./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 22:03:41,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:03:41,323 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:03:41,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:03:41,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:03:41,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:03:41,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:03:41,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:03:41,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:03:41,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:03:41,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:03:41,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:03:41,352 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:03:41,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:03:41,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:03:41,352 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:03:41,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:03:41,352 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:03:41,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:03:41,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:03:41,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:03:41,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:03:41,353 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:03:41,353 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:03:41,353 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:03:41,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:03:41,353 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:03:41,353 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:03:41,353 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:03:41,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:03:41,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:03:41,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:03:41,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:03:41,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:03:41,353 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:03:41,353 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:03:41,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:03:41,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:03:41,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:03:41,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:03:41,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:03:41,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:03:41,354 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-08 22:03:41,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:03:41,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:03:41,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:03:41,603 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:03:41,604 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:03:41,604 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-08 22:03:42,722 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8498f98c/3f4150d36c9f49559dcfff5d6f4d383f/FLAGa3e6bb489 [2025-03-08 22:03:43,051 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:03:43,052 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2025-03-08 22:03:43,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8498f98c/3f4150d36c9f49559dcfff5d6f4d383f/FLAGa3e6bb489 [2025-03-08 22:03:43,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8498f98c/3f4150d36c9f49559dcfff5d6f4d383f [2025-03-08 22:03:43,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:03:43,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:03:43,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:03:43,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:03:43,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:03:43,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:03:43" (1/1) ... [2025-03-08 22:03:43,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160ad2f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:43, skipping insertion in model container [2025-03-08 22:03:43,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:03:43" (1/1) ... [2025-03-08 22:03:43,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:03:43,671 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-08 22:03:43,673 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-08 22:03:43,674 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-08 22:03:43,675 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-08 22:03:43,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:03:43,725 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:03:43,771 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-08 22:03:43,772 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-08 22:03:43,772 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-08 22:03:43,773 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-08 22:03:43,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:03:43,820 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:03:43,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:43 WrapperNode [2025-03-08 22:03:43,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:03:43,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:03:43,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:03:43,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:03:43,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:43" (1/1) ... [2025-03-08 22:03:43,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:43" (1/1) ... [2025-03-08 22:03:43,868 INFO L138 Inliner]: procedures = 280, calls = 136, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 433 [2025-03-08 22:03:43,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:03:43,869 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:03:43,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:03:43,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:03:43,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:43" (1/1) ... [2025-03-08 22:03:43,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:43" (1/1) ... [2025-03-08 22:03:43,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:43" (1/1) ... [2025-03-08 22:03:43,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:43" (1/1) ... [2025-03-08 22:03:43,915 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:43" (1/1) ... [2025-03-08 22:03:43,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:43" (1/1) ... [2025-03-08 22:03:43,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:43" (1/1) ... [2025-03-08 22:03:43,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:43" (1/1) ... [2025-03-08 22:03:43,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:03:43,932 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:03:43,933 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:03:43,933 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:03:43,933 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:43" (1/1) ... [2025-03-08 22:03:43,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:03:43,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:03:43,962 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-08 22:03:43,965 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-08 22:03:43,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:03:43,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-08 22:03:43,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:03:43,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-08 22:03:43,983 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 22:03:43,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:03:43,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:03:43,983 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 22:03:43,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:03:43,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:03:43,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-08 22:03:43,983 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 22:03:43,984 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 22:03:43,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:03:43,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:03:43,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:03:43,986 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:03:44,115 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:03:44,116 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:03:44,575 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1072: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-08 22:03:44,575 INFO L1307 $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-08 22:03:44,684 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:03:44,684 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:03:44,716 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:03:44,720 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:03:44,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:03:44 BoogieIcfgContainer [2025-03-08 22:03:44,721 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:03:44,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:03:44,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:03:44,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:03:44,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:03:43" (1/3) ... [2025-03-08 22:03:44,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6478a9de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:03:44, skipping insertion in model container [2025-03-08 22:03:44,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:43" (2/3) ... [2025-03-08 22:03:44,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6478a9de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:03:44, skipping insertion in model container [2025-03-08 22:03:44,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:03:44" (3/3) ... [2025-03-08 22:03:44,729 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_92-evilcollapse_racing.i [2025-03-08 22:03:44,739 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:03:44,741 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-08 22:03:44,741 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:03:44,829 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 22:03:44,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 476 places, 494 transitions, 995 flow [2025-03-08 22:03:45,041 INFO L124 PetriNetUnfolderBase]: 21/524 cut-off events. [2025-03-08 22:03:45,044 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:03:45,051 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-08 22:03:45,052 INFO L82 GeneralOperation]: Start removeDead. Operand has 476 places, 494 transitions, 995 flow [2025-03-08 22:03:45,061 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 476 places, 494 transitions, 995 flow [2025-03-08 22:03:45,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:03:45,077 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;@24f3b45a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:03:45,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-08 22:03:45,092 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:03:45,093 INFO L124 PetriNetUnfolderBase]: 0/121 cut-off events. [2025-03-08 22:03:45,093 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:03:45,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:45,094 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-08 22:03:45,094 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-08 22:03:45,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:45,098 INFO L85 PathProgramCache]: Analyzing trace with hash 104462160, now seen corresponding path program 1 times [2025-03-08 22:03:45,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:45,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174427286] [2025-03-08 22:03:45,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:45,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:45,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 22:03:45,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 22:03:45,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:45,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:46,004 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-08 22:03:46,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:46,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174427286] [2025-03-08 22:03:46,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174427286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:46,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:46,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:46,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569097827] [2025-03-08 22:03:46,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:46,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:03:46,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:46,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:03:46,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:03:46,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 494 [2025-03-08 22:03:46,539 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-08 22:03:46,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:46,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 494 [2025-03-08 22:03:46,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:46,955 INFO L124 PetriNetUnfolderBase]: 319/1684 cut-off events. [2025-03-08 22:03:46,956 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-03-08 22:03:46,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2390 conditions, 1684 events. 319/1684 cut-off events. For 15/23 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-08 22:03:46,966 INFO L140 encePairwiseOnDemand]: 467/494 looper letters, 96 selfloop transitions, 10 changer transitions 2/475 dead transitions. [2025-03-08 22:03:46,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 475 transitions, 1169 flow [2025-03-08 22:03:46,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:03:46,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:03:46,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2343 transitions. [2025-03-08 22:03:46,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7904858299595142 [2025-03-08 22:03:46,985 INFO L175 Difference]: Start difference. First operand has 476 places, 494 transitions, 995 flow. Second operand 6 states and 2343 transitions. [2025-03-08 22:03:46,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 475 transitions, 1169 flow [2025-03-08 22:03:46,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 475 transitions, 1169 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:03:47,004 INFO L231 Difference]: Finished difference. Result has 477 places, 473 transitions, 973 flow [2025-03-08 22:03:47,007 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-08 22:03:47,010 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 1 predicate places. [2025-03-08 22:03:47,011 INFO L471 AbstractCegarLoop]: Abstraction has has 477 places, 473 transitions, 973 flow [2025-03-08 22:03:47,012 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-08 22:03:47,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:47,012 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-08 22:03:47,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:03:47,013 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-08 22:03:47,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:47,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1201978236, now seen corresponding path program 1 times [2025-03-08 22:03:47,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:47,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81674629] [2025-03-08 22:03:47,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:47,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:47,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 22:03:47,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 22:03:47,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:47,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:47,502 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-08 22:03:47,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:47,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81674629] [2025-03-08 22:03:47,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81674629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:47,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:47,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:47,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840705098] [2025-03-08 22:03:47,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:47,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:03:47,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:47,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:03:47,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:03:48,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 494 [2025-03-08 22:03:48,028 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-08 22:03:48,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:48,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 494 [2025-03-08 22:03:48,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:48,208 INFO L124 PetriNetUnfolderBase]: 319/1680 cut-off events. [2025-03-08 22:03:48,208 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-03-08 22:03:48,210 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-08 22:03:48,215 INFO L140 encePairwiseOnDemand]: 482/494 looper letters, 96 selfloop transitions, 10 changer transitions 0/471 dead transitions. [2025-03-08 22:03:48,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 471 transitions, 1181 flow [2025-03-08 22:03:48,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:03:48,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:03:48,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2328 transitions. [2025-03-08 22:03:48,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7854251012145749 [2025-03-08 22:03:48,219 INFO L175 Difference]: Start difference. First operand has 477 places, 473 transitions, 973 flow. Second operand 6 states and 2328 transitions. [2025-03-08 22:03:48,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 471 transitions, 1181 flow [2025-03-08 22:03:48,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 471 transitions, 1161 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:03:48,225 INFO L231 Difference]: Finished difference. Result has 473 places, 471 transitions, 969 flow [2025-03-08 22:03:48,226 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-08 22:03:48,226 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -3 predicate places. [2025-03-08 22:03:48,226 INFO L471 AbstractCegarLoop]: Abstraction has has 473 places, 471 transitions, 969 flow [2025-03-08 22:03:48,228 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-08 22:03:48,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:48,228 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-08 22:03:48,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:03:48,228 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-08 22:03:48,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:48,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1791493855, now seen corresponding path program 1 times [2025-03-08 22:03:48,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:48,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037571495] [2025-03-08 22:03:48,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:48,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:48,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 22:03:48,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 22:03:48,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:48,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:48,319 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-08 22:03:48,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:48,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037571495] [2025-03-08 22:03:48,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037571495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:48,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:48,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:03:48,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550056951] [2025-03-08 22:03:48,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:48,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:03:48,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:48,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:03:48,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:03:48,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 494 [2025-03-08 22:03:48,338 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-08 22:03:48,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:48,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 494 [2025-03-08 22:03:48,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:48,405 INFO L124 PetriNetUnfolderBase]: 15/649 cut-off events. [2025-03-08 22:03:48,405 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-08 22:03:48,406 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-08 22:03:48,409 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 15 selfloop transitions, 2 changer transitions 0/472 dead transitions. [2025-03-08 22:03:48,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 472 transitions, 1005 flow [2025-03-08 22:03:48,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:03:48,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:03:48,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1404 transitions. [2025-03-08 22:03:48,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473684210526315 [2025-03-08 22:03:48,412 INFO L175 Difference]: Start difference. First operand has 473 places, 471 transitions, 969 flow. Second operand 3 states and 1404 transitions. [2025-03-08 22:03:48,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 472 transitions, 1005 flow [2025-03-08 22:03:48,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 472 transitions, 985 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:03:48,422 INFO L231 Difference]: Finished difference. Result has 471 places, 472 transitions, 961 flow [2025-03-08 22:03:48,423 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-08 22:03:48,424 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -5 predicate places. [2025-03-08 22:03:48,424 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 472 transitions, 961 flow [2025-03-08 22:03:48,425 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-08 22:03:48,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:48,425 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-08 22:03:48,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:03:48,426 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-08 22:03:48,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:48,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1917540210, now seen corresponding path program 1 times [2025-03-08 22:03:48,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:48,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937404224] [2025-03-08 22:03:48,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:48,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:48,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 22:03:48,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 22:03:48,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:48,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:48,906 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-08 22:03:48,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:48,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937404224] [2025-03-08 22:03:48,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937404224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:48,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:48,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:48,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602055284] [2025-03-08 22:03:48,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:48,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:03:48,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:48,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:03:48,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:03:49,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 494 [2025-03-08 22:03:49,230 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-08 22:03:49,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:49,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 494 [2025-03-08 22:03:49,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:49,440 INFO L124 PetriNetUnfolderBase]: 320/1802 cut-off events. [2025-03-08 22:03:49,440 INFO L125 PetriNetUnfolderBase]: For 16/24 co-relation queries the response was YES. [2025-03-08 22:03:49,444 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-08 22:03:49,448 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 103 selfloop transitions, 5 changer transitions 0/471 dead transitions. [2025-03-08 22:03:49,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 471 transitions, 1175 flow [2025-03-08 22:03:49,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:03:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:03:49,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2323 transitions. [2025-03-08 22:03:49,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7837381916329285 [2025-03-08 22:03:49,454 INFO L175 Difference]: Start difference. First operand has 471 places, 472 transitions, 961 flow. Second operand 6 states and 2323 transitions. [2025-03-08 22:03:49,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 471 transitions, 1175 flow [2025-03-08 22:03:49,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 471 transitions, 1173 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:03:49,460 INFO L231 Difference]: Finished difference. Result has 474 places, 471 transitions, 967 flow [2025-03-08 22:03:49,461 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-08 22:03:49,462 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -2 predicate places. [2025-03-08 22:03:49,463 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 471 transitions, 967 flow [2025-03-08 22:03:49,464 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-08 22:03:49,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:49,464 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-08 22:03:49,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:03:49,464 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-08 22:03:49,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:49,466 INFO L85 PathProgramCache]: Analyzing trace with hash -2115935445, now seen corresponding path program 1 times [2025-03-08 22:03:49,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:49,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563562344] [2025-03-08 22:03:49,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:49,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:49,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 22:03:49,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 22:03:49,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:49,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:49,554 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-08 22:03:49,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:49,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563562344] [2025-03-08 22:03:49,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563562344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:49,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:49,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:03:49,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942332168] [2025-03-08 22:03:49,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:49,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:03:49,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:49,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:03:49,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:03:49,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 494 [2025-03-08 22:03:49,568 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-08 22:03:49,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:49,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 494 [2025-03-08 22:03:49,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:49,656 INFO L124 PetriNetUnfolderBase]: 15/835 cut-off events. [2025-03-08 22:03:49,656 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-08 22:03:49,658 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-08 22:03:49,660 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 15 selfloop transitions, 2 changer transitions 0/472 dead transitions. [2025-03-08 22:03:49,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 472 transitions, 1003 flow [2025-03-08 22:03:49,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:03:49,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:03:49,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1404 transitions. [2025-03-08 22:03:49,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473684210526315 [2025-03-08 22:03:49,663 INFO L175 Difference]: Start difference. First operand has 474 places, 471 transitions, 967 flow. Second operand 3 states and 1404 transitions. [2025-03-08 22:03:49,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 472 transitions, 1003 flow [2025-03-08 22:03:49,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 472 transitions, 993 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:03:49,669 INFO L231 Difference]: Finished difference. Result has 472 places, 472 transitions, 969 flow [2025-03-08 22:03:49,670 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-08 22:03:49,673 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -4 predicate places. [2025-03-08 22:03:49,673 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 472 transitions, 969 flow [2025-03-08 22:03:49,674 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-08 22:03:49,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:49,674 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-08 22:03:49,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:03:49,674 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-08 22:03:49,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:49,677 INFO L85 PathProgramCache]: Analyzing trace with hash 19709408, now seen corresponding path program 1 times [2025-03-08 22:03:49,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:49,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818594506] [2025-03-08 22:03:49,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:49,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:49,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 22:03:49,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 22:03:49,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:49,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:50,182 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-08 22:03:50,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:50,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818594506] [2025-03-08 22:03:50,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818594506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:50,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:50,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:50,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779475180] [2025-03-08 22:03:50,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:50,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:03:50,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:50,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:03:50,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:03:50,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 494 [2025-03-08 22:03:50,812 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-08 22:03:50,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:50,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 494 [2025-03-08 22:03:50,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:50,938 INFO L124 PetriNetUnfolderBase]: 83/1145 cut-off events. [2025-03-08 22:03:50,939 INFO L125 PetriNetUnfolderBase]: For 10/14 co-relation queries the response was YES. [2025-03-08 22:03:50,941 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-08 22:03:50,944 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 66 selfloop transitions, 5 changer transitions 0/471 dead transitions. [2025-03-08 22:03:50,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 471 transitions, 1109 flow [2025-03-08 22:03:50,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:03:50,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:03:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2508 transitions. [2025-03-08 22:03:50,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8461538461538461 [2025-03-08 22:03:50,949 INFO L175 Difference]: Start difference. First operand has 472 places, 472 transitions, 969 flow. Second operand 6 states and 2508 transitions. [2025-03-08 22:03:50,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 471 transitions, 1109 flow [2025-03-08 22:03:50,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 471 transitions, 1107 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:03:50,956 INFO L231 Difference]: Finished difference. Result has 475 places, 471 transitions, 975 flow [2025-03-08 22:03:50,957 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-08 22:03:50,958 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -1 predicate places. [2025-03-08 22:03:50,958 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 471 transitions, 975 flow [2025-03-08 22:03:50,960 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-08 22:03:50,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:50,960 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-08 22:03:50,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:03:50,961 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-08 22:03:50,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:50,962 INFO L85 PathProgramCache]: Analyzing trace with hash 587467578, now seen corresponding path program 1 times [2025-03-08 22:03:50,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:50,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793600766] [2025-03-08 22:03:50,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:50,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:50,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-08 22:03:50,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-08 22:03:51,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:51,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:51,390 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-08 22:03:51,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:51,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793600766] [2025-03-08 22:03:51,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793600766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:51,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:51,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:51,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146119470] [2025-03-08 22:03:51,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:51,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:03:51,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:51,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:03:51,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:03:51,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 494 [2025-03-08 22:03:51,797 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-08 22:03:51,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:51,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 494 [2025-03-08 22:03:51,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:52,099 INFO L124 PetriNetUnfolderBase]: 320/1982 cut-off events. [2025-03-08 22:03:52,099 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-08 22:03:52,102 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-08 22:03:52,107 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 103 selfloop transitions, 5 changer transitions 0/470 dead transitions. [2025-03-08 22:03:52,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 470 transitions, 1189 flow [2025-03-08 22:03:52,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:03:52,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:03:52,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2323 transitions. [2025-03-08 22:03:52,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7837381916329285 [2025-03-08 22:03:52,112 INFO L175 Difference]: Start difference. First operand has 475 places, 471 transitions, 975 flow. Second operand 6 states and 2323 transitions. [2025-03-08 22:03:52,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 470 transitions, 1189 flow [2025-03-08 22:03:52,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 470 transitions, 1179 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:03:52,117 INFO L231 Difference]: Finished difference. Result has 474 places, 470 transitions, 973 flow [2025-03-08 22:03:52,118 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-08 22:03:52,118 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -2 predicate places. [2025-03-08 22:03:52,118 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 470 transitions, 973 flow [2025-03-08 22:03:52,120 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-08 22:03:52,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:52,120 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-08 22:03:52,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:03:52,120 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-08 22:03:52,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:52,121 INFO L85 PathProgramCache]: Analyzing trace with hash -880772235, now seen corresponding path program 1 times [2025-03-08 22:03:52,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:52,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127675799] [2025-03-08 22:03:52,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:52,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:52,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 22:03:52,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 22:03:52,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:52,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:52,604 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-08 22:03:52,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:52,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127675799] [2025-03-08 22:03:52,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127675799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:52,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:52,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:52,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516344710] [2025-03-08 22:03:52,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:52,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:03:52,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:52,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:03:52,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:03:52,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 494 [2025-03-08 22:03:52,969 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-08 22:03:52,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:52,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 494 [2025-03-08 22:03:52,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:53,196 INFO L124 PetriNetUnfolderBase]: 320/1978 cut-off events. [2025-03-08 22:03:53,197 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-08 22:03:53,199 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-08 22:03:53,205 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 99 selfloop transitions, 5 changer transitions 0/469 dead transitions. [2025-03-08 22:03:53,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 469 transitions, 1179 flow [2025-03-08 22:03:53,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:03:53,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:03:53,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2343 transitions. [2025-03-08 22:03:53,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7904858299595142 [2025-03-08 22:03:53,210 INFO L175 Difference]: Start difference. First operand has 474 places, 470 transitions, 973 flow. Second operand 6 states and 2343 transitions. [2025-03-08 22:03:53,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 469 transitions, 1179 flow [2025-03-08 22:03:53,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 469 transitions, 1169 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:03:53,216 INFO L231 Difference]: Finished difference. Result has 473 places, 469 transitions, 971 flow [2025-03-08 22:03:53,218 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-08 22:03:53,219 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -3 predicate places. [2025-03-08 22:03:53,220 INFO L471 AbstractCegarLoop]: Abstraction has has 473 places, 469 transitions, 971 flow [2025-03-08 22:03:53,221 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-08 22:03:53,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:53,221 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-08 22:03:53,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:03:53,221 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-08 22:03:53,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:53,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1699201572, now seen corresponding path program 1 times [2025-03-08 22:03:53,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:53,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110162038] [2025-03-08 22:03:53,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:53,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:53,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 22:03:53,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 22:03:53,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:53,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:53,632 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-08 22:03:53,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:53,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110162038] [2025-03-08 22:03:53,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110162038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:53,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:53,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:53,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573780134] [2025-03-08 22:03:53,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:53,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:03:53,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:53,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:03:53,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:03:54,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 494 [2025-03-08 22:03:54,105 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-08 22:03:54,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:54,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 494 [2025-03-08 22:03:54,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:54,325 INFO L124 PetriNetUnfolderBase]: 320/1974 cut-off events. [2025-03-08 22:03:54,325 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-03-08 22:03:54,327 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-08 22:03:54,333 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 99 selfloop transitions, 5 changer transitions 0/468 dead transitions. [2025-03-08 22:03:54,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 468 transitions, 1177 flow [2025-03-08 22:03:54,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:03:54,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:03:54,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2343 transitions. [2025-03-08 22:03:54,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7904858299595142 [2025-03-08 22:03:54,337 INFO L175 Difference]: Start difference. First operand has 473 places, 469 transitions, 971 flow. Second operand 6 states and 2343 transitions. [2025-03-08 22:03:54,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 468 transitions, 1177 flow [2025-03-08 22:03:54,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 468 transitions, 1167 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:03:54,343 INFO L231 Difference]: Finished difference. Result has 472 places, 468 transitions, 969 flow [2025-03-08 22:03:54,344 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-08 22:03:54,345 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -4 predicate places. [2025-03-08 22:03:54,345 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 468 transitions, 969 flow [2025-03-08 22:03:54,346 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-08 22:03:54,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:54,346 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-08 22:03:54,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:03:54,347 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-08 22:03:54,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:54,347 INFO L85 PathProgramCache]: Analyzing trace with hash -924732901, now seen corresponding path program 1 times [2025-03-08 22:03:54,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:54,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453224290] [2025-03-08 22:03:54,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:54,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:54,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 22:03:54,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 22:03:54,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:54,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:54,771 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-08 22:03:54,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:54,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453224290] [2025-03-08 22:03:54,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453224290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:54,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:54,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:54,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377154164] [2025-03-08 22:03:54,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:54,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:03:54,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:54,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:03:54,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:03:55,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 494 [2025-03-08 22:03:55,372 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-08 22:03:55,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:55,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 494 [2025-03-08 22:03:55,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:55,645 INFO L124 PetriNetUnfolderBase]: 320/1970 cut-off events. [2025-03-08 22:03:55,645 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-08 22:03:55,648 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-08 22:03:55,655 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 104 selfloop transitions, 5 changer transitions 0/467 dead transitions. [2025-03-08 22:03:55,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 467 transitions, 1185 flow [2025-03-08 22:03:55,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:03:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:03:55,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2318 transitions. [2025-03-08 22:03:55,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.782051282051282 [2025-03-08 22:03:55,660 INFO L175 Difference]: Start difference. First operand has 472 places, 468 transitions, 969 flow. Second operand 6 states and 2318 transitions. [2025-03-08 22:03:55,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 467 transitions, 1185 flow [2025-03-08 22:03:55,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 467 transitions, 1175 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:03:55,667 INFO L231 Difference]: Finished difference. Result has 471 places, 467 transitions, 967 flow [2025-03-08 22:03:55,668 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-08 22:03:55,668 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -5 predicate places. [2025-03-08 22:03:55,668 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 467 transitions, 967 flow [2025-03-08 22:03:55,669 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-08 22:03:55,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:55,670 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-08 22:03:55,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:03:55,670 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-08 22:03:55,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:55,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1594145177, now seen corresponding path program 1 times [2025-03-08 22:03:55,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:55,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753713666] [2025-03-08 22:03:55,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:55,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:55,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-08 22:03:55,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-08 22:03:55,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:55,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:55,806 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-08 22:03:55,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:55,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753713666] [2025-03-08 22:03:55,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753713666] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:03:55,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446601564] [2025-03-08 22:03:55,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:55,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:03:55,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:03:55,809 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-08 22:03:55,811 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-08 22:03:55,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-08 22:03:55,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-08 22:03:55,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:55,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:55,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:03:56,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:03:56,149 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-08 22:03:56,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:03:56,278 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-08 22:03:56,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446601564] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:03:56,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:03:56,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 22:03:56,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706382494] [2025-03-08 22:03:56,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:03:56,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:03:56,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:56,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:03:56,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:03:56,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 494 [2025-03-08 22:03:56,309 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-08 22:03:56,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:56,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 494 [2025-03-08 22:03:56,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:56,504 INFO L124 PetriNetUnfolderBase]: 15/999 cut-off events. [2025-03-08 22:03:56,505 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-03-08 22:03:56,506 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-08 22:03:56,508 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 19 selfloop transitions, 9 changer transitions 0/475 dead transitions. [2025-03-08 22:03:56,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 475 transitions, 1041 flow [2025-03-08 22:03:56,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:03:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 22:03:56,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4161 transitions. [2025-03-08 22:03:56,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9358974358974359 [2025-03-08 22:03:56,514 INFO L175 Difference]: Start difference. First operand has 471 places, 467 transitions, 967 flow. Second operand 9 states and 4161 transitions. [2025-03-08 22:03:56,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 475 transitions, 1041 flow [2025-03-08 22:03:56,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 475 transitions, 1031 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:03:56,522 INFO L231 Difference]: Finished difference. Result has 477 places, 473 transitions, 1007 flow [2025-03-08 22:03:56,522 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-08 22:03:56,523 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 1 predicate places. [2025-03-08 22:03:56,523 INFO L471 AbstractCegarLoop]: Abstraction has has 477 places, 473 transitions, 1007 flow [2025-03-08 22:03:56,526 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-08 22:03:56,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:56,527 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-08 22:03:56,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 22:03:56,727 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-08 22:03:56,727 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-08 22:03:56,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:56,729 INFO L85 PathProgramCache]: Analyzing trace with hash -562622987, now seen corresponding path program 2 times [2025-03-08 22:03:56,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:56,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233974113] [2025-03-08 22:03:56,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:03:56,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:56,784 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 422 statements into 2 equivalence classes. [2025-03-08 22:03:56,792 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 123 of 422 statements. [2025-03-08 22:03:56,792 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:03:56,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:56,996 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-08 22:03:56,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:56,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233974113] [2025-03-08 22:03:56,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233974113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:56,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:56,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:56,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157713291] [2025-03-08 22:03:56,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:56,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:03:56,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:56,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:03:56,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:03:58,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 494 [2025-03-08 22:03:58,003 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-08 22:03:58,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:58,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 494 [2025-03-08 22:03:58,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:58,288 INFO L124 PetriNetUnfolderBase]: 83/1311 cut-off events. [2025-03-08 22:03:58,288 INFO L125 PetriNetUnfolderBase]: For 18/22 co-relation queries the response was YES. [2025-03-08 22:03:58,290 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-08 22:03:58,293 INFO L140 encePairwiseOnDemand]: 482/494 looper letters, 69 selfloop transitions, 10 changer transitions 0/471 dead transitions. [2025-03-08 22:03:58,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 471 transitions, 1161 flow [2025-03-08 22:03:58,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:03:58,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:03:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2463 transitions. [2025-03-08 22:03:58,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8309716599190283 [2025-03-08 22:03:58,297 INFO L175 Difference]: Start difference. First operand has 477 places, 473 transitions, 1007 flow. Second operand 6 states and 2463 transitions. [2025-03-08 22:03:58,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 471 transitions, 1161 flow [2025-03-08 22:03:58,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 471 transitions, 1155 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 22:03:58,305 INFO L231 Difference]: Finished difference. Result has 479 places, 471 transitions, 1017 flow [2025-03-08 22:03:58,305 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-08 22:03:58,306 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 3 predicate places. [2025-03-08 22:03:58,307 INFO L471 AbstractCegarLoop]: Abstraction has has 479 places, 471 transitions, 1017 flow [2025-03-08 22:03:58,308 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-08 22:03:58,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:58,308 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-08 22:03:58,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:03:58,308 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-08 22:03:58,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:58,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1765512560, now seen corresponding path program 1 times [2025-03-08 22:03:58,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:58,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688212301] [2025-03-08 22:03:58,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:58,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:58,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-08 22:03:58,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-08 22:03:58,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:58,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:58,649 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-08 22:03:58,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:58,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688212301] [2025-03-08 22:03:58,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688212301] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:03:58,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422736658] [2025-03-08 22:03:58,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:58,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:03:58,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:03:58,653 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-08 22:03:58,655 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-08 22:03:58,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-08 22:03:58,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-08 22:03:58,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:58,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:58,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 1615 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 22:03:58,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:03:59,287 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-08 22:03:59,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:03:59,597 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-08 22:03:59,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422736658] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:03:59,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:03:59,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-08 22:03:59,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068274060] [2025-03-08 22:03:59,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:03:59,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 22:03:59,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:59,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 22:03:59,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-08 22:03:59,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 494 [2025-03-08 22:03:59,686 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-08 22:03:59,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:59,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 494 [2025-03-08 22:03:59,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:00,705 INFO L124 PetriNetUnfolderBase]: 16/2377 cut-off events. [2025-03-08 22:04:00,705 INFO L125 PetriNetUnfolderBase]: For 81/82 co-relation queries the response was YES. [2025-03-08 22:04:00,707 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-08 22:04:00,710 INFO L140 encePairwiseOnDemand]: 483/494 looper letters, 51 selfloop transitions, 68 changer transitions 0/557 dead transitions. [2025-03-08 22:04:00,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 557 transitions, 1665 flow [2025-03-08 22:04:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-08 22:04:00,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-08 22:04:00,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 28671 transitions. [2025-03-08 22:04:00,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9212454212454212 [2025-03-08 22:04:00,773 INFO L175 Difference]: Start difference. First operand has 479 places, 471 transitions, 1017 flow. Second operand 63 states and 28671 transitions. [2025-03-08 22:04:00,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 557 transitions, 1665 flow [2025-03-08 22:04:00,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 557 transitions, 1645 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:04:00,780 INFO L231 Difference]: Finished difference. Result has 552 places, 533 transitions, 1517 flow [2025-03-08 22:04:00,780 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-08 22:04:00,781 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 76 predicate places. [2025-03-08 22:04:00,781 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 533 transitions, 1517 flow [2025-03-08 22:04:00,786 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-08 22:04:00,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:00,787 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-08 22:04:00,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 22:04:00,987 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-08 22:04:00,988 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-08 22:04:00,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:00,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1780035740, now seen corresponding path program 2 times [2025-03-08 22:04:00,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:00,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833883403] [2025-03-08 22:04:00,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:04:00,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:01,150 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1484 statements into 2 equivalence classes. [2025-03-08 22:04:01,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 166 of 1484 statements. [2025-03-08 22:04:01,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:04:01,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:01,382 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-08 22:04:01,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:01,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833883403] [2025-03-08 22:04:01,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833883403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:01,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:01,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:01,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232493606] [2025-03-08 22:04:01,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:01,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:04:01,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:01,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:04:01,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:04:01,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 494 [2025-03-08 22:04:01,929 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-08 22:04:01,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:01,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 494 [2025-03-08 22:04:01,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:02,630 INFO L124 PetriNetUnfolderBase]: 103/2776 cut-off events. [2025-03-08 22:04:02,630 INFO L125 PetriNetUnfolderBase]: For 441/446 co-relation queries the response was YES. [2025-03-08 22:04:02,632 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-08 22:04:02,636 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 66 selfloop transitions, 5 changer transitions 0/532 dead transitions. [2025-03-08 22:04:02,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 532 transitions, 1657 flow [2025-03-08 22:04:02,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:02,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:02,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2508 transitions. [2025-03-08 22:04:02,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8461538461538461 [2025-03-08 22:04:02,638 INFO L175 Difference]: Start difference. First operand has 552 places, 533 transitions, 1517 flow. Second operand 6 states and 2508 transitions. [2025-03-08 22:04:02,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 532 transitions, 1657 flow [2025-03-08 22:04:02,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 532 transitions, 1581 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-08 22:04:02,646 INFO L231 Difference]: Finished difference. Result has 549 places, 532 transitions, 1449 flow [2025-03-08 22:04:02,646 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-08 22:04:02,647 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 73 predicate places. [2025-03-08 22:04:02,647 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 532 transitions, 1449 flow [2025-03-08 22:04:02,647 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-08 22:04:02,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:02,648 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-08 22:04:02,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:04:02,648 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-08 22:04:02,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:02,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1761338453, now seen corresponding path program 1 times [2025-03-08 22:04:02,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:02,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387816708] [2025-03-08 22:04:02,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:02,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:02,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1491 statements into 1 equivalence classes. [2025-03-08 22:04:02,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1491 of 1491 statements. [2025-03-08 22:04:02,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:02,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:05,221 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-08 22:04:05,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:05,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387816708] [2025-03-08 22:04:05,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387816708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:04:05,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608380760] [2025-03-08 22:04:05,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:05,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:04:05,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:04:05,224 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-08 22:04:05,226 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-08 22:04:05,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1491 statements into 1 equivalence classes. [2025-03-08 22:04:06,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1491 of 1491 statements. [2025-03-08 22:04:06,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:06,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:06,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 5801 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 22:04:06,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:04:06,751 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-08 22:04:06,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:04:07,387 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-08 22:04:07,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608380760] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:04:07,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:04:07,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-08 22:04:07,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597923695] [2025-03-08 22:04:07,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:04:07,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 22:04:07,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:07,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 22:04:07,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 22:04:07,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 494 [2025-03-08 22:04:07,432 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-08 22:04:07,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:07,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 494 [2025-03-08 22:04:07,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:09,208 INFO L124 PetriNetUnfolderBase]: 16/4536 cut-off events. [2025-03-08 22:04:09,208 INFO L125 PetriNetUnfolderBase]: For 3212/3213 co-relation queries the response was YES. [2025-03-08 22:04:09,212 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-08 22:04:09,215 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 51 selfloop transitions, 135 changer transitions 0/633 dead transitions. [2025-03-08 22:04:09,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 633 transitions, 2585 flow [2025-03-08 22:04:09,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-08 22:04:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-08 22:04:09,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 20739 transitions. [2025-03-08 22:04:09,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9329284750337382 [2025-03-08 22:04:09,226 INFO L175 Difference]: Start difference. First operand has 549 places, 532 transitions, 1449 flow. Second operand 45 states and 20739 transitions. [2025-03-08 22:04:09,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 633 transitions, 2585 flow [2025-03-08 22:04:09,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 633 transitions, 2575 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:04:09,237 INFO L231 Difference]: Finished difference. Result has 597 places, 607 transitions, 2313 flow [2025-03-08 22:04:09,238 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-08 22:04:09,238 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 121 predicate places. [2025-03-08 22:04:09,238 INFO L471 AbstractCegarLoop]: Abstraction has has 597 places, 607 transitions, 2313 flow [2025-03-08 22:04:09,243 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-08 22:04:09,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:09,244 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-08 22:04:09,263 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-08 22:04:09,444 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-08 22:04:09,444 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-08 22:04:09,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:09,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1371626923, now seen corresponding path program 2 times [2025-03-08 22:04:09,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:09,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811177548] [2025-03-08 22:04:09,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:04:09,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:09,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2931 statements into 2 equivalence classes. [2025-03-08 22:04:09,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 173 of 2931 statements. [2025-03-08 22:04:09,768 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:04:09,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:10,117 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-08 22:04:10,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:10,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811177548] [2025-03-08 22:04:10,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811177548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:10,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:10,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:10,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719769407] [2025-03-08 22:04:10,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:10,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:04:10,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:10,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:04:10,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:04:10,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 494 [2025-03-08 22:04:10,400 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-08 22:04:10,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:10,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 494 [2025-03-08 22:04:10,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:13,489 INFO L124 PetriNetUnfolderBase]: 360/5838 cut-off events. [2025-03-08 22:04:13,489 INFO L125 PetriNetUnfolderBase]: For 1234/1243 co-relation queries the response was YES. [2025-03-08 22:04:13,497 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-08 22:04:13,505 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 104 selfloop transitions, 5 changer transitions 0/606 dead transitions. [2025-03-08 22:04:13,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 606 transitions, 2529 flow [2025-03-08 22:04:13,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:13,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2318 transitions. [2025-03-08 22:04:13,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.782051282051282 [2025-03-08 22:04:13,507 INFO L175 Difference]: Start difference. First operand has 597 places, 607 transitions, 2313 flow. Second operand 6 states and 2318 transitions. [2025-03-08 22:04:13,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 606 transitions, 2529 flow [2025-03-08 22:04:13,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 606 transitions, 2421 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-03-08 22:04:13,521 INFO L231 Difference]: Finished difference. Result has 583 places, 606 transitions, 2213 flow [2025-03-08 22:04:13,522 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-08 22:04:13,523 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 107 predicate places. [2025-03-08 22:04:13,523 INFO L471 AbstractCegarLoop]: Abstraction has has 583 places, 606 transitions, 2213 flow [2025-03-08 22:04:13,524 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-08 22:04:13,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:13,524 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-08 22:04:13,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:04:13,525 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-08 22:04:13,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:13,530 INFO L85 PathProgramCache]: Analyzing trace with hash 172510926, now seen corresponding path program 1 times [2025-03-08 22:04:13,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:13,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373654961] [2025-03-08 22:04:13,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:13,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:13,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2945 statements into 1 equivalence classes. [2025-03-08 22:04:13,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2945 of 2945 statements. [2025-03-08 22:04:13,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:13,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:16,458 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-08 22:04:16,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:16,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373654961] [2025-03-08 22:04:16,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373654961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:16,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:16,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:04:16,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140591565] [2025-03-08 22:04:16,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:16,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:16,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:16,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:16,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:16,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 494 [2025-03-08 22:04:16,480 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-08 22:04:16,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:16,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 494 [2025-03-08 22:04:16,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:18,151 INFO L124 PetriNetUnfolderBase]: 46/4808 cut-off events. [2025-03-08 22:04:18,151 INFO L125 PetriNetUnfolderBase]: For 1202/1206 co-relation queries the response was YES. [2025-03-08 22:04:18,156 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-08 22:04:18,158 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 22 selfloop transitions, 2 changer transitions 0/614 dead transitions. [2025-03-08 22:04:18,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 614 transitions, 2277 flow [2025-03-08 22:04:18,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1411 transitions. [2025-03-08 22:04:18,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520917678812416 [2025-03-08 22:04:18,160 INFO L175 Difference]: Start difference. First operand has 583 places, 606 transitions, 2213 flow. Second operand 3 states and 1411 transitions. [2025-03-08 22:04:18,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 614 transitions, 2277 flow [2025-03-08 22:04:18,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 614 transitions, 2267 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:04:18,172 INFO L231 Difference]: Finished difference. Result has 581 places, 606 transitions, 2211 flow [2025-03-08 22:04:18,173 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-08 22:04:18,173 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 105 predicate places. [2025-03-08 22:04:18,173 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 606 transitions, 2211 flow [2025-03-08 22:04:18,174 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-08 22:04:18,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:18,174 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-08 22:04:18,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:04:18,175 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-08 22:04:18,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:18,180 INFO L85 PathProgramCache]: Analyzing trace with hash 109410050, now seen corresponding path program 1 times [2025-03-08 22:04:18,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:18,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763517032] [2025-03-08 22:04:18,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:18,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:18,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2945 statements into 1 equivalence classes. [2025-03-08 22:04:18,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2945 of 2945 statements. [2025-03-08 22:04:18,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:18,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:29,280 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-08 22:04:29,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:29,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763517032] [2025-03-08 22:04:29,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763517032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:04:29,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236774331] [2025-03-08 22:04:29,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:29,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:04:29,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:04:29,283 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-08 22:04:29,285 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-08 22:04:30,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2945 statements into 1 equivalence classes. [2025-03-08 22:04:31,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2945 of 2945 statements. [2025-03-08 22:04:31,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:31,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:31,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 11747 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 22:04:31,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:04:32,606 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-08 22:04:32,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:04:34,090 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-08 22:04:34,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236774331] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:04:34,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:04:34,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-03-08 22:04:34,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375116669] [2025-03-08 22:04:34,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:04:34,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-08 22:04:34,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:34,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-08 22:04:34,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-03-08 22:04:34,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 494 [2025-03-08 22:04:34,177 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-08 22:04:34,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:34,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 494 [2025-03-08 22:04:34,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:40,239 INFO L124 PetriNetUnfolderBase]: 15/8582 cut-off events. [2025-03-08 22:04:40,240 INFO L125 PetriNetUnfolderBase]: For 13377/13378 co-relation queries the response was YES. [2025-03-08 22:04:40,249 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-08 22:04:40,254 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 96 selfloop transitions, 270 changer transitions 0/812 dead transitions. [2025-03-08 22:04:40,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 812 transitions, 5129 flow [2025-03-08 22:04:40,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-08 22:04:40,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-03-08 22:04:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 41461 transitions. [2025-03-08 22:04:40,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9325461088618984 [2025-03-08 22:04:40,275 INFO L175 Difference]: Start difference. First operand has 581 places, 606 transitions, 2211 flow. Second operand 90 states and 41461 transitions. [2025-03-08 22:04:40,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 812 transitions, 5129 flow [2025-03-08 22:04:40,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 812 transitions, 5125 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:40,296 INFO L231 Difference]: Finished difference. Result has 684 places, 744 transitions, 4199 flow [2025-03-08 22:04:40,298 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-08 22:04:40,298 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 208 predicate places. [2025-03-08 22:04:40,299 INFO L471 AbstractCegarLoop]: Abstraction has has 684 places, 744 transitions, 4199 flow [2025-03-08 22:04:40,303 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-08 22:04:40,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:40,305 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-08 22:04:40,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 22:04:40,505 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-08 22:04:40,505 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-08 22:04:40,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:40,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1758399554, now seen corresponding path program 2 times [2025-03-08 22:04:40,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:40,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200373910] [2025-03-08 22:04:40,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:04:40,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:41,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5645 statements into 2 equivalence classes. [2025-03-08 22:04:41,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 185 of 5645 statements. [2025-03-08 22:04:41,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:04:41,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:41,257 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-08 22:04:41,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:41,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200373910] [2025-03-08 22:04:41,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200373910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:41,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:41,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:41,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557723676] [2025-03-08 22:04:41,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:41,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:04:41,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:41,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:04:41,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:04:41,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 494 [2025-03-08 22:04:41,521 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-08 22:04:41,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:41,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 494 [2025-03-08 22:04:41,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:51,328 INFO L124 PetriNetUnfolderBase]: 739/11137 cut-off events. [2025-03-08 22:04:51,328 INFO L125 PetriNetUnfolderBase]: For 3557/3571 co-relation queries the response was YES. [2025-03-08 22:04:51,351 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-08 22:04:51,366 INFO L140 encePairwiseOnDemand]: 459/494 looper letters, 143 selfloop transitions, 118 changer transitions 0/893 dead transitions. [2025-03-08 22:04:51,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 893 transitions, 5020 flow [2025-03-08 22:04:51,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:51,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:51,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2458 transitions. [2025-03-08 22:04:51,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8292847503373819 [2025-03-08 22:04:51,369 INFO L175 Difference]: Start difference. First operand has 684 places, 744 transitions, 4199 flow. Second operand 6 states and 2458 transitions. [2025-03-08 22:04:51,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 893 transitions, 5020 flow [2025-03-08 22:04:51,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 893 transitions, 4666 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-03-08 22:04:51,404 INFO L231 Difference]: Finished difference. Result has 652 places, 861 transitions, 4620 flow [2025-03-08 22:04:51,405 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-08 22:04:51,405 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 176 predicate places. [2025-03-08 22:04:51,405 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 861 transitions, 4620 flow [2025-03-08 22:04:51,406 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-08 22:04:51,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:51,407 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-08 22:04:51,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:04:51,407 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-08 22:04:51,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:51,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1140597947, now seen corresponding path program 1 times [2025-03-08 22:04:51,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:51,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226935962] [2025-03-08 22:04:51,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:51,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:51,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5659 statements into 1 equivalence classes. [2025-03-08 22:04:52,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5659 of 5659 statements. [2025-03-08 22:04:52,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:52,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat