./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 11:10:26,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:10:27,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:10:27,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:10:27,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:10:27,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:10:27,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:10:27,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:10:27,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:10:27,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:10:27,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:10:27,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:10:27,043 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:10:27,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:10:27,043 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:10:27,043 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:10:27,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:10:27,044 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:10:27,044 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:10:27,044 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:10:27,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:10:27,044 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:10:27,044 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:10:27,044 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:10:27,044 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:10:27,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:10:27,045 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:10:27,045 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:10:27,045 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:10:27,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:10:27,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:10:27,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:10:27,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:10:27,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:10:27,045 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:10:27,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:10:27,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:10:27,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:10:27,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:10:27,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:10:27,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:10:27,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:10:27,045 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-17 11:10:27,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:10:27,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:10:27,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:10:27,288 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:10:27,288 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:10:27,289 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-17 11:10:28,479 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c150faaac/4659795ad0bf4c55861252bbb1eface5/FLAG708e29268 [2025-03-17 11:10:28,805 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:10:28,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2025-03-17 11:10:28,829 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c150faaac/4659795ad0bf4c55861252bbb1eface5/FLAG708e29268 [2025-03-17 11:10:29,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c150faaac/4659795ad0bf4c55861252bbb1eface5 [2025-03-17 11:10:29,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:10:29,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:10:29,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:10:29,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:10:29,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:10:29,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:10:29" (1/1) ... [2025-03-17 11:10:29,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67380d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:29, skipping insertion in model container [2025-03-17 11:10:29,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:10:29" (1/1) ... [2025-03-17 11:10:29,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:10:29,354 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:10:29,354 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:10:29,355 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:10:29,355 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:10:29,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:10:29,400 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:10:29,442 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:10:29,443 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:10:29,445 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:10:29,446 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:10:29,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:10:29,501 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:10:29,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:29 WrapperNode [2025-03-17 11:10:29,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:10:29,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:10:29,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:10:29,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:10:29,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:29" (1/1) ... [2025-03-17 11:10:29,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:29" (1/1) ... [2025-03-17 11:10:29,545 INFO L138 Inliner]: procedures = 280, calls = 136, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 433 [2025-03-17 11:10:29,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:10:29,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:10:29,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:10:29,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:10:29,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:29" (1/1) ... [2025-03-17 11:10:29,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:29" (1/1) ... [2025-03-17 11:10:29,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:29" (1/1) ... [2025-03-17 11:10:29,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:29" (1/1) ... [2025-03-17 11:10:29,580 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:29" (1/1) ... [2025-03-17 11:10:29,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:29" (1/1) ... [2025-03-17 11:10:29,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:29" (1/1) ... [2025-03-17 11:10:29,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:29" (1/1) ... [2025-03-17 11:10:29,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:10:29,594 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:10:29,594 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:10:29,594 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:10:29,595 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:29" (1/1) ... [2025-03-17 11:10:29,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:10:29,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:10:29,625 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-17 11:10:29,627 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-17 11:10:29,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:10:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 11:10:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:10:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-17 11:10:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 11:10:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:10:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:10:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 11:10:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:10:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:10:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 11:10:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 11:10:29,643 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 11:10:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:10:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:10:29,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:10:29,645 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:10:29,761 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:10:29,762 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:10:30,219 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1072: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-17 11:10:30,219 INFO L1322 $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-17 11:10:30,317 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:10:30,317 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:10:30,350 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:10:30,354 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:10:30,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:10:30 BoogieIcfgContainer [2025-03-17 11:10:30,355 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:10:30,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:10:30,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:10:30,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:10:30,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:10:29" (1/3) ... [2025-03-17 11:10:30,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c7569e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:10:30, skipping insertion in model container [2025-03-17 11:10:30,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:29" (2/3) ... [2025-03-17 11:10:30,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c7569e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:10:30, skipping insertion in model container [2025-03-17 11:10:30,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:10:30" (3/3) ... [2025-03-17 11:10:30,364 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_92-evilcollapse_racing.i [2025-03-17 11:10:30,376 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:10:30,378 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-17 11:10:30,378 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:10:30,466 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-17 11:10:30,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 476 places, 494 transitions, 995 flow [2025-03-17 11:10:30,665 INFO L124 PetriNetUnfolderBase]: 21/524 cut-off events. [2025-03-17 11:10:30,667 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:10:30,674 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 951 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-17 11:10:30,675 INFO L82 GeneralOperation]: Start removeDead. Operand has 476 places, 494 transitions, 995 flow [2025-03-17 11:10:30,683 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 476 places, 494 transitions, 995 flow [2025-03-17 11:10:30,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:10:30,703 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;@db7280b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:10:30,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-17 11:10:30,722 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:10:30,722 INFO L124 PetriNetUnfolderBase]: 0/121 cut-off events. [2025-03-17 11:10:30,723 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:10:30,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:30,723 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-17 11:10:30,724 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-17 11:10:30,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:30,728 INFO L85 PathProgramCache]: Analyzing trace with hash -273959627, now seen corresponding path program 1 times [2025-03-17 11:10:30,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:30,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406383182] [2025-03-17 11:10:30,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:30,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:30,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 11:10:30,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 11:10:30,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:30,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:31,740 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-17 11:10:31,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:31,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406383182] [2025-03-17 11:10:31,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406383182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:31,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:31,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:10:31,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706687217] [2025-03-17 11:10:31,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:31,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:10:31,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:31,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:10:31,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:10:32,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 494 [2025-03-17 11:10:32,236 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-17 11:10:32,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:32,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 494 [2025-03-17 11:10:32,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:32,628 INFO L124 PetriNetUnfolderBase]: 319/1684 cut-off events. [2025-03-17 11:10:32,628 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-03-17 11:10:32,631 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 9523 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-17 11:10:32,636 INFO L140 encePairwiseOnDemand]: 467/494 looper letters, 96 selfloop transitions, 10 changer transitions 2/475 dead transitions. [2025-03-17 11:10:32,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 475 transitions, 1169 flow [2025-03-17 11:10:32,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:10:32,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:10:32,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2343 transitions. [2025-03-17 11:10:32,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7904858299595142 [2025-03-17 11:10:32,653 INFO L175 Difference]: Start difference. First operand has 476 places, 494 transitions, 995 flow. Second operand 6 states and 2343 transitions. [2025-03-17 11:10:32,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 475 transitions, 1169 flow [2025-03-17 11:10:32,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 475 transitions, 1169 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:10:32,665 INFO L231 Difference]: Finished difference. Result has 477 places, 473 transitions, 973 flow [2025-03-17 11:10:32,667 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-17 11:10:32,669 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 1 predicate places. [2025-03-17 11:10:32,669 INFO L471 AbstractCegarLoop]: Abstraction has has 477 places, 473 transitions, 973 flow [2025-03-17 11:10:32,670 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-17 11:10:32,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:32,671 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-17 11:10:32,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:10:32,671 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-17 11:10:32,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:32,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1355630997, now seen corresponding path program 1 times [2025-03-17 11:10:32,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:32,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959650638] [2025-03-17 11:10:32,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:32,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:32,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 11:10:32,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 11:10:32,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:32,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:33,124 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-17 11:10:33,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:33,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959650638] [2025-03-17 11:10:33,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959650638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:33,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:33,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:10:33,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849044875] [2025-03-17 11:10:33,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:33,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:10:33,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:33,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:10:33,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:10:33,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 494 [2025-03-17 11:10:33,637 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-17 11:10:33,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:33,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 494 [2025-03-17 11:10:33,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:33,811 INFO L124 PetriNetUnfolderBase]: 319/1680 cut-off events. [2025-03-17 11:10:33,811 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2025-03-17 11:10:33,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2397 conditions, 1680 events. 319/1680 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9529 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-17 11:10:33,818 INFO L140 encePairwiseOnDemand]: 482/494 looper letters, 96 selfloop transitions, 10 changer transitions 0/471 dead transitions. [2025-03-17 11:10:33,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 471 transitions, 1181 flow [2025-03-17 11:10:33,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:10:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:10:33,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2328 transitions. [2025-03-17 11:10:33,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7854251012145749 [2025-03-17 11:10:33,822 INFO L175 Difference]: Start difference. First operand has 477 places, 473 transitions, 973 flow. Second operand 6 states and 2328 transitions. [2025-03-17 11:10:33,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 471 transitions, 1181 flow [2025-03-17 11:10:33,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 471 transitions, 1161 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:10:33,829 INFO L231 Difference]: Finished difference. Result has 473 places, 471 transitions, 969 flow [2025-03-17 11:10:33,830 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-17 11:10:33,830 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -3 predicate places. [2025-03-17 11:10:33,830 INFO L471 AbstractCegarLoop]: Abstraction has has 473 places, 471 transitions, 969 flow [2025-03-17 11:10:33,832 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-17 11:10:33,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:33,832 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-17 11:10:33,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:10:33,832 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-17 11:10:33,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:33,833 INFO L85 PathProgramCache]: Analyzing trace with hash -494807816, now seen corresponding path program 1 times [2025-03-17 11:10:33,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:33,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809883095] [2025-03-17 11:10:33,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:33,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:33,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 11:10:33,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 11:10:33,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:33,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:33,922 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-17 11:10:33,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:33,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809883095] [2025-03-17 11:10:33,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809883095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:33,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:33,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:10:33,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832803094] [2025-03-17 11:10:33,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:33,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:10:33,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:33,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:10:33,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:10:33,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 494 [2025-03-17 11:10:33,942 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-17 11:10:33,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:33,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 494 [2025-03-17 11:10:33,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:34,008 INFO L124 PetriNetUnfolderBase]: 15/649 cut-off events. [2025-03-17 11:10:34,008 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-03-17 11:10:34,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 649 events. 15/649 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1440 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-17 11:10:34,011 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 15 selfloop transitions, 2 changer transitions 0/472 dead transitions. [2025-03-17 11:10:34,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 472 transitions, 1005 flow [2025-03-17 11:10:34,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:10:34,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:10:34,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1404 transitions. [2025-03-17 11:10:34,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473684210526315 [2025-03-17 11:10:34,013 INFO L175 Difference]: Start difference. First operand has 473 places, 471 transitions, 969 flow. Second operand 3 states and 1404 transitions. [2025-03-17 11:10:34,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 472 transitions, 1005 flow [2025-03-17 11:10:34,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 472 transitions, 985 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:10:34,021 INFO L231 Difference]: Finished difference. Result has 471 places, 472 transitions, 961 flow [2025-03-17 11:10:34,022 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-17 11:10:34,022 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -5 predicate places. [2025-03-17 11:10:34,022 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 472 transitions, 961 flow [2025-03-17 11:10:34,023 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-17 11:10:34,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:34,024 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-17 11:10:34,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:10:34,024 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-17 11:10:34,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:34,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1057476323, now seen corresponding path program 1 times [2025-03-17 11:10:34,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:34,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300806189] [2025-03-17 11:10:34,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:34,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:34,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 11:10:34,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 11:10:34,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:34,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:34,464 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-17 11:10:34,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:34,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300806189] [2025-03-17 11:10:34,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300806189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:34,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:34,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:10:34,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412947642] [2025-03-17 11:10:34,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:34,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:10:34,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:34,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:10:34,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:10:34,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 494 [2025-03-17 11:10:34,783 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-17 11:10:34,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:34,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 494 [2025-03-17 11:10:34,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:34,997 INFO L124 PetriNetUnfolderBase]: 320/1802 cut-off events. [2025-03-17 11:10:34,997 INFO L125 PetriNetUnfolderBase]: For 8/16 co-relation queries the response was YES. [2025-03-17 11:10:34,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2563 conditions, 1802 events. 320/1802 cut-off events. For 8/16 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9919 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-17 11:10:35,004 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 103 selfloop transitions, 5 changer transitions 0/471 dead transitions. [2025-03-17 11:10:35,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 471 transitions, 1175 flow [2025-03-17 11:10:35,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:10:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:10:35,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2323 transitions. [2025-03-17 11:10:35,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7837381916329285 [2025-03-17 11:10:35,010 INFO L175 Difference]: Start difference. First operand has 471 places, 472 transitions, 961 flow. Second operand 6 states and 2323 transitions. [2025-03-17 11:10:35,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 471 transitions, 1175 flow [2025-03-17 11:10:35,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 471 transitions, 1173 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:10:35,018 INFO L231 Difference]: Finished difference. Result has 474 places, 471 transitions, 967 flow [2025-03-17 11:10:35,019 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-17 11:10:35,020 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -2 predicate places. [2025-03-17 11:10:35,020 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 471 transitions, 967 flow [2025-03-17 11:10:35,021 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-17 11:10:35,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:35,021 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-17 11:10:35,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:10:35,022 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-17 11:10:35,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:35,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1961239720, now seen corresponding path program 1 times [2025-03-17 11:10:35,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:35,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657087778] [2025-03-17 11:10:35,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:35,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:35,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 11:10:35,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 11:10:35,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:35,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:35,099 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-17 11:10:35,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:35,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657087778] [2025-03-17 11:10:35,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657087778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:35,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:35,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:10:35,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448411219] [2025-03-17 11:10:35,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:35,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:10:35,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:35,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:10:35,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:10:35,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 494 [2025-03-17 11:10:35,114 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-17 11:10:35,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:35,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 494 [2025-03-17 11:10:35,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:35,194 INFO L124 PetriNetUnfolderBase]: 15/835 cut-off events. [2025-03-17 11:10:35,194 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-03-17 11:10:35,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 835 events. 15/835 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1651 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-17 11:10:35,198 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 15 selfloop transitions, 2 changer transitions 0/472 dead transitions. [2025-03-17 11:10:35,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 472 transitions, 1003 flow [2025-03-17 11:10:35,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:10:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:10:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1404 transitions. [2025-03-17 11:10:35,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473684210526315 [2025-03-17 11:10:35,203 INFO L175 Difference]: Start difference. First operand has 474 places, 471 transitions, 967 flow. Second operand 3 states and 1404 transitions. [2025-03-17 11:10:35,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 472 transitions, 1003 flow [2025-03-17 11:10:35,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 472 transitions, 993 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:10:35,211 INFO L231 Difference]: Finished difference. Result has 472 places, 472 transitions, 969 flow [2025-03-17 11:10:35,212 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-17 11:10:35,213 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -4 predicate places. [2025-03-17 11:10:35,213 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 472 transitions, 969 flow [2025-03-17 11:10:35,215 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-17 11:10:35,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:35,215 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-17 11:10:35,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:10:35,216 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-17 11:10:35,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:35,216 INFO L85 PathProgramCache]: Analyzing trace with hash 858840606, now seen corresponding path program 1 times [2025-03-17 11:10:35,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:35,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332325765] [2025-03-17 11:10:35,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:35,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:35,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 11:10:35,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 11:10:35,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:35,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:35,733 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-17 11:10:35,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:35,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332325765] [2025-03-17 11:10:35,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332325765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:35,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:35,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:10:35,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560981764] [2025-03-17 11:10:35,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:35,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:10:35,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:35,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:10:35,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:10:36,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 494 [2025-03-17 11:10:36,304 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-17 11:10:36,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:36,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 494 [2025-03-17 11:10:36,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:36,446 INFO L124 PetriNetUnfolderBase]: 83/1145 cut-off events. [2025-03-17 11:10:36,447 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2025-03-17 11:10:36,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 1145 events. 83/1145 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3554 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-17 11:10:36,450 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 66 selfloop transitions, 5 changer transitions 0/471 dead transitions. [2025-03-17 11:10:36,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 471 transitions, 1109 flow [2025-03-17 11:10:36,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:10:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:10:36,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2508 transitions. [2025-03-17 11:10:36,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8461538461538461 [2025-03-17 11:10:36,454 INFO L175 Difference]: Start difference. First operand has 472 places, 472 transitions, 969 flow. Second operand 6 states and 2508 transitions. [2025-03-17 11:10:36,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 471 transitions, 1109 flow [2025-03-17 11:10:36,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 471 transitions, 1107 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:10:36,460 INFO L231 Difference]: Finished difference. Result has 475 places, 471 transitions, 975 flow [2025-03-17 11:10:36,461 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-17 11:10:36,461 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -1 predicate places. [2025-03-17 11:10:36,462 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 471 transitions, 975 flow [2025-03-17 11:10:36,463 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-17 11:10:36,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:36,463 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-17 11:10:36,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:10:36,463 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-17 11:10:36,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:36,464 INFO L85 PathProgramCache]: Analyzing trace with hash -364103304, now seen corresponding path program 1 times [2025-03-17 11:10:36,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:36,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93758335] [2025-03-17 11:10:36,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:36,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:36,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 11:10:36,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 11:10:36,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:36,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:36,864 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-17 11:10:36,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:36,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93758335] [2025-03-17 11:10:36,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93758335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:36,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:36,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:10:36,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628490356] [2025-03-17 11:10:36,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:36,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:10:36,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:36,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:10:36,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:10:37,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 494 [2025-03-17 11:10:37,259 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-17 11:10:37,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:37,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 494 [2025-03-17 11:10:37,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:37,601 INFO L124 PetriNetUnfolderBase]: 320/1982 cut-off events. [2025-03-17 11:10:37,601 INFO L125 PetriNetUnfolderBase]: For 11/19 co-relation queries the response was YES. [2025-03-17 11:10:37,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2847 conditions, 1982 events. 320/1982 cut-off events. For 11/19 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10481 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-17 11:10:37,609 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 103 selfloop transitions, 5 changer transitions 0/470 dead transitions. [2025-03-17 11:10:37,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 470 transitions, 1189 flow [2025-03-17 11:10:37,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:10:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:10:37,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2323 transitions. [2025-03-17 11:10:37,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7837381916329285 [2025-03-17 11:10:37,613 INFO L175 Difference]: Start difference. First operand has 475 places, 471 transitions, 975 flow. Second operand 6 states and 2323 transitions. [2025-03-17 11:10:37,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 470 transitions, 1189 flow [2025-03-17 11:10:37,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 470 transitions, 1179 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:10:37,621 INFO L231 Difference]: Finished difference. Result has 474 places, 470 transitions, 973 flow [2025-03-17 11:10:37,622 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-17 11:10:37,623 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -2 predicate places. [2025-03-17 11:10:37,623 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 470 transitions, 973 flow [2025-03-17 11:10:37,625 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-17 11:10:37,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:37,626 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-17 11:10:37,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:10:37,626 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-17 11:10:37,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:37,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1314707857, now seen corresponding path program 1 times [2025-03-17 11:10:37,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:37,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276926217] [2025-03-17 11:10:37,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:37,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:37,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 11:10:37,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 11:10:37,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:37,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:38,082 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-17 11:10:38,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:38,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276926217] [2025-03-17 11:10:38,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276926217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:38,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:38,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:10:38,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97600303] [2025-03-17 11:10:38,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:38,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:10:38,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:38,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:10:38,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:10:38,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 494 [2025-03-17 11:10:38,412 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-17 11:10:38,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:38,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 494 [2025-03-17 11:10:38,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:38,627 INFO L124 PetriNetUnfolderBase]: 320/1978 cut-off events. [2025-03-17 11:10:38,627 INFO L125 PetriNetUnfolderBase]: For 11/19 co-relation queries the response was YES. [2025-03-17 11:10:38,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2827 conditions, 1978 events. 320/1978 cut-off events. For 11/19 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10492 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-17 11:10:38,632 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 99 selfloop transitions, 5 changer transitions 0/469 dead transitions. [2025-03-17 11:10:38,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 469 transitions, 1179 flow [2025-03-17 11:10:38,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:10:38,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:10:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2343 transitions. [2025-03-17 11:10:38,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7904858299595142 [2025-03-17 11:10:38,637 INFO L175 Difference]: Start difference. First operand has 474 places, 470 transitions, 973 flow. Second operand 6 states and 2343 transitions. [2025-03-17 11:10:38,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 469 transitions, 1179 flow [2025-03-17 11:10:38,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 469 transitions, 1169 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:10:38,642 INFO L231 Difference]: Finished difference. Result has 473 places, 469 transitions, 971 flow [2025-03-17 11:10:38,643 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-17 11:10:38,643 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -3 predicate places. [2025-03-17 11:10:38,643 INFO L471 AbstractCegarLoop]: Abstraction has has 473 places, 469 transitions, 971 flow [2025-03-17 11:10:38,644 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-17 11:10:38,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:38,645 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-17 11:10:38,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:10:38,645 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-17 11:10:38,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:38,645 INFO L85 PathProgramCache]: Analyzing trace with hash -741519559, now seen corresponding path program 1 times [2025-03-17 11:10:38,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:38,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935732984] [2025-03-17 11:10:38,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:38,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:38,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 11:10:38,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 11:10:38,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:38,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:39,071 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-17 11:10:39,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:39,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935732984] [2025-03-17 11:10:39,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935732984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:39,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:39,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:10:39,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868463210] [2025-03-17 11:10:39,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:39,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:10:39,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:39,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:10:39,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:10:39,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 494 [2025-03-17 11:10:39,506 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-17 11:10:39,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:39,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 494 [2025-03-17 11:10:39,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:39,704 INFO L124 PetriNetUnfolderBase]: 320/1974 cut-off events. [2025-03-17 11:10:39,705 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2025-03-17 11:10:39,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2823 conditions, 1974 events. 320/1974 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10499 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-17 11:10:39,712 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 99 selfloop transitions, 5 changer transitions 0/468 dead transitions. [2025-03-17 11:10:39,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 468 transitions, 1177 flow [2025-03-17 11:10:39,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:10:39,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:10:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2343 transitions. [2025-03-17 11:10:39,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7904858299595142 [2025-03-17 11:10:39,716 INFO L175 Difference]: Start difference. First operand has 473 places, 469 transitions, 971 flow. Second operand 6 states and 2343 transitions. [2025-03-17 11:10:39,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 468 transitions, 1177 flow [2025-03-17 11:10:39,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 468 transitions, 1167 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:10:39,722 INFO L231 Difference]: Finished difference. Result has 472 places, 468 transitions, 969 flow [2025-03-17 11:10:39,723 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-17 11:10:39,724 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -4 predicate places. [2025-03-17 11:10:39,724 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 468 transitions, 969 flow [2025-03-17 11:10:39,725 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-17 11:10:39,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:39,725 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-17 11:10:39,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:10:39,726 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-17 11:10:39,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:39,726 INFO L85 PathProgramCache]: Analyzing trace with hash -562719568, now seen corresponding path program 1 times [2025-03-17 11:10:39,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:39,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435118855] [2025-03-17 11:10:39,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:39,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:39,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-17 11:10:39,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-17 11:10:39,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:39,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:40,123 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 11:10:40,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:40,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435118855] [2025-03-17 11:10:40,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435118855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:40,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:40,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:10:40,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328188569] [2025-03-17 11:10:40,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:40,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:10:40,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:40,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:10:40,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:10:40,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 494 [2025-03-17 11:10:40,663 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-17 11:10:40,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:40,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 494 [2025-03-17 11:10:40,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:40,904 INFO L124 PetriNetUnfolderBase]: 320/1970 cut-off events. [2025-03-17 11:10:40,904 INFO L125 PetriNetUnfolderBase]: For 11/19 co-relation queries the response was YES. [2025-03-17 11:10:40,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2839 conditions, 1970 events. 320/1970 cut-off events. For 11/19 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10447 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-17 11:10:40,910 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 104 selfloop transitions, 5 changer transitions 0/467 dead transitions. [2025-03-17 11:10:40,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 467 transitions, 1185 flow [2025-03-17 11:10:40,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:10:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:10:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2318 transitions. [2025-03-17 11:10:40,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.782051282051282 [2025-03-17 11:10:40,915 INFO L175 Difference]: Start difference. First operand has 472 places, 468 transitions, 969 flow. Second operand 6 states and 2318 transitions. [2025-03-17 11:10:40,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 467 transitions, 1185 flow [2025-03-17 11:10:40,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 467 transitions, 1175 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:10:40,922 INFO L231 Difference]: Finished difference. Result has 471 places, 467 transitions, 967 flow [2025-03-17 11:10:40,922 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-17 11:10:40,923 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -5 predicate places. [2025-03-17 11:10:40,923 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 467 transitions, 967 flow [2025-03-17 11:10:40,924 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-17 11:10:40,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:40,924 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-17 11:10:40,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:10:40,924 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-17 11:10:40,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:40,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1180989401, now seen corresponding path program 1 times [2025-03-17 11:10:40,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:40,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109776920] [2025-03-17 11:10:40,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:40,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:40,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-17 11:10:40,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-17 11:10:40,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:40,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 11:10:41,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:41,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109776920] [2025-03-17 11:10:41,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109776920] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:10:41,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032327388] [2025-03-17 11:10:41,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:41,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:10:41,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:10:41,115 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-17 11:10:41,117 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-17 11:10:41,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-17 11:10:41,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-17 11:10:41,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:41,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:41,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 11:10:41,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:10:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 11:10:41,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:10:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 11:10:41,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032327388] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:10:41,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:10:41,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 11:10:41,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382982941] [2025-03-17 11:10:41,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:10:41,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:10:41,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:41,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:10:41,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:10:41,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 494 [2025-03-17 11:10:41,617 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-17 11:10:41,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:41,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 494 [2025-03-17 11:10:41,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:41,786 INFO L124 PetriNetUnfolderBase]: 15/999 cut-off events. [2025-03-17 11:10:41,786 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-17 11:10:41,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1113 conditions, 999 events. 15/999 cut-off events. For 6/7 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-17 11:10:41,789 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 19 selfloop transitions, 9 changer transitions 0/475 dead transitions. [2025-03-17 11:10:41,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 475 transitions, 1041 flow [2025-03-17 11:10:41,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:10:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:10:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4161 transitions. [2025-03-17 11:10:41,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9358974358974359 [2025-03-17 11:10:41,795 INFO L175 Difference]: Start difference. First operand has 471 places, 467 transitions, 967 flow. Second operand 9 states and 4161 transitions. [2025-03-17 11:10:41,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 475 transitions, 1041 flow [2025-03-17 11:10:41,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 475 transitions, 1031 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:10:41,800 INFO L231 Difference]: Finished difference. Result has 477 places, 473 transitions, 1007 flow [2025-03-17 11:10:41,801 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-17 11:10:41,801 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 1 predicate places. [2025-03-17 11:10:41,801 INFO L471 AbstractCegarLoop]: Abstraction has has 477 places, 473 transitions, 1007 flow [2025-03-17 11:10:41,803 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-17 11:10:41,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:41,804 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-17 11:10:41,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:10:42,007 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-17 11:10:42,007 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-17 11:10:42,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:42,009 INFO L85 PathProgramCache]: Analyzing trace with hash -572916965, now seen corresponding path program 2 times [2025-03-17 11:10:42,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:42,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545160849] [2025-03-17 11:10:42,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:10:42,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:42,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 422 statements into 2 equivalence classes. [2025-03-17 11:10:42,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 123 of 422 statements. [2025-03-17 11:10:42,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:10:42,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2025-03-17 11:10:42,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:42,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545160849] [2025-03-17 11:10:42,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545160849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:42,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:42,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:10:42,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611809758] [2025-03-17 11:10:42,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:42,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:10:42,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:42,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:10:42,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:10:43,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 494 [2025-03-17 11:10:43,226 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-17 11:10:43,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:43,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 494 [2025-03-17 11:10:43,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:43,492 INFO L124 PetriNetUnfolderBase]: 83/1311 cut-off events. [2025-03-17 11:10:43,492 INFO L125 PetriNetUnfolderBase]: For 14/18 co-relation queries the response was YES. [2025-03-17 11:10:43,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1747 conditions, 1311 events. 83/1311 cut-off events. For 14/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3082 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-17 11:10:43,496 INFO L140 encePairwiseOnDemand]: 482/494 looper letters, 69 selfloop transitions, 10 changer transitions 0/471 dead transitions. [2025-03-17 11:10:43,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 471 transitions, 1161 flow [2025-03-17 11:10:43,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:10:43,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:10:43,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2463 transitions. [2025-03-17 11:10:43,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8309716599190283 [2025-03-17 11:10:43,501 INFO L175 Difference]: Start difference. First operand has 477 places, 473 transitions, 1007 flow. Second operand 6 states and 2463 transitions. [2025-03-17 11:10:43,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 471 transitions, 1161 flow [2025-03-17 11:10:43,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 471 transitions, 1155 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 11:10:43,508 INFO L231 Difference]: Finished difference. Result has 479 places, 471 transitions, 1017 flow [2025-03-17 11:10:43,508 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-17 11:10:43,510 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 3 predicate places. [2025-03-17 11:10:43,510 INFO L471 AbstractCegarLoop]: Abstraction has has 479 places, 471 transitions, 1017 flow [2025-03-17 11:10:43,511 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-17 11:10:43,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:43,512 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-17 11:10:43,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:10:43,513 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-17 11:10:43,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:43,514 INFO L85 PathProgramCache]: Analyzing trace with hash 2031459840, now seen corresponding path program 1 times [2025-03-17 11:10:43,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:43,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555913125] [2025-03-17 11:10:43,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:43,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:43,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-17 11:10:43,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-17 11:10:43,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:43,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:43,834 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2025-03-17 11:10:43,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:43,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555913125] [2025-03-17 11:10:43,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555913125] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:10:43,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683765518] [2025-03-17 11:10:43,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:43,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:10:43,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:10:43,837 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-17 11:10:43,839 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-17 11:10:44,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-17 11:10:44,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-17 11:10:44,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:44,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:44,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 1615 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 11:10:44,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:10:44,470 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 1 proven. 489 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-17 11:10:44,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:10:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 1 proven. 489 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-17 11:10:44,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683765518] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:10:44,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:10:44,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-17 11:10:44,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872703044] [2025-03-17 11:10:44,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:10:44,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 11:10:44,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:44,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 11:10:44,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:10:44,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 494 [2025-03-17 11:10:44,866 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-17 11:10:44,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:44,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 494 [2025-03-17 11:10:44,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:45,878 INFO L124 PetriNetUnfolderBase]: 16/2377 cut-off events. [2025-03-17 11:10:45,878 INFO L125 PetriNetUnfolderBase]: For 80/81 co-relation queries the response was YES. [2025-03-17 11:10:45,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 2377 events. 16/2377 cut-off events. For 80/81 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1187 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-17 11:10:45,882 INFO L140 encePairwiseOnDemand]: 483/494 looper letters, 51 selfloop transitions, 68 changer transitions 0/557 dead transitions. [2025-03-17 11:10:45,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 557 transitions, 1665 flow [2025-03-17 11:10:45,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-17 11:10:45,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-17 11:10:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 28671 transitions. [2025-03-17 11:10:45,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9212454212454212 [2025-03-17 11:10:45,903 INFO L175 Difference]: Start difference. First operand has 479 places, 471 transitions, 1017 flow. Second operand 63 states and 28671 transitions. [2025-03-17 11:10:45,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 557 transitions, 1665 flow [2025-03-17 11:10:45,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 557 transitions, 1645 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:10:45,910 INFO L231 Difference]: Finished difference. Result has 552 places, 533 transitions, 1517 flow [2025-03-17 11:10:45,911 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-17 11:10:45,911 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 76 predicate places. [2025-03-17 11:10:45,911 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 533 transitions, 1517 flow [2025-03-17 11:10:45,914 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-17 11:10:45,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:45,914 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-17 11:10:45,924 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-17 11:10:46,115 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-17 11:10:46,115 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-17 11:10:46,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:46,118 INFO L85 PathProgramCache]: Analyzing trace with hash 528093027, now seen corresponding path program 2 times [2025-03-17 11:10:46,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:46,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027799143] [2025-03-17 11:10:46,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:10:46,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:46,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1484 statements into 2 equivalence classes. [2025-03-17 11:10:46,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 166 of 1484 statements. [2025-03-17 11:10:46,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:10:46,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15305 trivial. 0 not checked. [2025-03-17 11:10:46,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:46,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027799143] [2025-03-17 11:10:46,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027799143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:46,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:46,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:10:46,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416048898] [2025-03-17 11:10:46,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:46,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:10:46,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:46,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:10:46,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:10:46,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 494 [2025-03-17 11:10:46,966 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-17 11:10:46,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:46,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 494 [2025-03-17 11:10:46,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:47,666 INFO L124 PetriNetUnfolderBase]: 103/2776 cut-off events. [2025-03-17 11:10:47,666 INFO L125 PetriNetUnfolderBase]: For 436/441 co-relation queries the response was YES. [2025-03-17 11:10:47,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3946 conditions, 2776 events. 103/2776 cut-off events. For 436/441 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3994 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-17 11:10:47,675 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 66 selfloop transitions, 5 changer transitions 0/532 dead transitions. [2025-03-17 11:10:47,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 532 transitions, 1657 flow [2025-03-17 11:10:47,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:10:47,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:10:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2508 transitions. [2025-03-17 11:10:47,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8461538461538461 [2025-03-17 11:10:47,677 INFO L175 Difference]: Start difference. First operand has 552 places, 533 transitions, 1517 flow. Second operand 6 states and 2508 transitions. [2025-03-17 11:10:47,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 532 transitions, 1657 flow [2025-03-17 11:10:47,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 532 transitions, 1581 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-17 11:10:47,686 INFO L231 Difference]: Finished difference. Result has 549 places, 532 transitions, 1449 flow [2025-03-17 11:10:47,687 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-17 11:10:47,687 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 73 predicate places. [2025-03-17 11:10:47,687 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 532 transitions, 1449 flow [2025-03-17 11:10:47,688 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-17 11:10:47,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:47,688 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-17 11:10:47,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:10:47,688 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-17 11:10:47,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:47,691 INFO L85 PathProgramCache]: Analyzing trace with hash 470706944, now seen corresponding path program 1 times [2025-03-17 11:10:47,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:47,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565922104] [2025-03-17 11:10:47,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:47,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:47,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1491 statements into 1 equivalence classes. [2025-03-17 11:10:47,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1491 of 1491 statements. [2025-03-17 11:10:47,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:47,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:50,013 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 7978 proven. 3409 refuted. 0 times theorem prover too weak. 3918 trivial. 0 not checked. [2025-03-17 11:10:50,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:50,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565922104] [2025-03-17 11:10:50,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565922104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:10:50,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066367268] [2025-03-17 11:10:50,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:50,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:10:50,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:10:50,016 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-17 11:10:50,018 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-17 11:10:50,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1491 statements into 1 equivalence classes. [2025-03-17 11:10:50,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1491 of 1491 statements. [2025-03-17 11:10:50,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:50,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:51,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 5801 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 11:10:51,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:10:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 7978 proven. 3409 refuted. 0 times theorem prover too weak. 3918 trivial. 0 not checked. [2025-03-17 11:10:51,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:10:52,282 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 7978 proven. 3409 refuted. 0 times theorem prover too weak. 3918 trivial. 0 not checked. [2025-03-17 11:10:52,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066367268] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:10:52,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:10:52,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-17 11:10:52,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745908735] [2025-03-17 11:10:52,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:10:52,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 11:10:52,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:52,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 11:10:52,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 11:10:52,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 494 [2025-03-17 11:10:52,332 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-17 11:10:52,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:52,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 494 [2025-03-17 11:10:52,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:54,218 INFO L124 PetriNetUnfolderBase]: 16/4536 cut-off events. [2025-03-17 11:10:54,219 INFO L125 PetriNetUnfolderBase]: For 3211/3212 co-relation queries the response was YES. [2025-03-17 11:10:54,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5332 conditions, 4536 events. 16/4536 cut-off events. For 3211/3212 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1188 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-17 11:10:54,226 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 51 selfloop transitions, 135 changer transitions 0/633 dead transitions. [2025-03-17 11:10:54,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 633 transitions, 2585 flow [2025-03-17 11:10:54,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-17 11:10:54,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-17 11:10:54,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 20739 transitions. [2025-03-17 11:10:54,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9329284750337382 [2025-03-17 11:10:54,235 INFO L175 Difference]: Start difference. First operand has 549 places, 532 transitions, 1449 flow. Second operand 45 states and 20739 transitions. [2025-03-17 11:10:54,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 633 transitions, 2585 flow [2025-03-17 11:10:54,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 633 transitions, 2575 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:10:54,247 INFO L231 Difference]: Finished difference. Result has 597 places, 607 transitions, 2313 flow [2025-03-17 11:10:54,247 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-17 11:10:54,248 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 121 predicate places. [2025-03-17 11:10:54,248 INFO L471 AbstractCegarLoop]: Abstraction has has 597 places, 607 transitions, 2313 flow [2025-03-17 11:10:54,251 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-17 11:10:54,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:54,252 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-17 11:10:54,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 11:10:54,452 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-17 11:10:54,453 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-17 11:10:54,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:54,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1678760960, now seen corresponding path program 2 times [2025-03-17 11:10:54,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:54,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860454853] [2025-03-17 11:10:54,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:10:54,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:54,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2931 statements into 2 equivalence classes. [2025-03-17 11:10:54,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 173 of 2931 statements. [2025-03-17 11:10:54,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:10:54,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:54,990 INFO L134 CoverageAnalysis]: Checked inductivity of 71641 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71641 trivial. 0 not checked. [2025-03-17 11:10:54,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:54,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860454853] [2025-03-17 11:10:54,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860454853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:54,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:54,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:10:54,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368081265] [2025-03-17 11:10:54,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:54,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:10:54,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:54,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:10:54,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:10:55,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 494 [2025-03-17 11:10:55,374 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-17 11:10:55,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:55,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 494 [2025-03-17 11:10:55,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:58,025 INFO L124 PetriNetUnfolderBase]: 360/5838 cut-off events. [2025-03-17 11:10:58,025 INFO L125 PetriNetUnfolderBase]: For 1225/1234 co-relation queries the response was YES. [2025-03-17 11:10:58,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8836 conditions, 5838 events. 360/5838 cut-off events. For 1225/1234 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 11851 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-17 11:10:58,037 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 104 selfloop transitions, 5 changer transitions 0/606 dead transitions. [2025-03-17 11:10:58,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 606 transitions, 2529 flow [2025-03-17 11:10:58,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:10:58,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:10:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2318 transitions. [2025-03-17 11:10:58,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.782051282051282 [2025-03-17 11:10:58,039 INFO L175 Difference]: Start difference. First operand has 597 places, 607 transitions, 2313 flow. Second operand 6 states and 2318 transitions. [2025-03-17 11:10:58,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 606 transitions, 2529 flow [2025-03-17 11:10:58,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 606 transitions, 2421 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-03-17 11:10:58,052 INFO L231 Difference]: Finished difference. Result has 583 places, 606 transitions, 2213 flow [2025-03-17 11:10:58,053 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-17 11:10:58,053 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 107 predicate places. [2025-03-17 11:10:58,054 INFO L471 AbstractCegarLoop]: Abstraction has has 583 places, 606 transitions, 2213 flow [2025-03-17 11:10:58,054 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-17 11:10:58,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:58,055 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-17 11:10:58,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:10:58,055 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-17 11:10:58,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:58,060 INFO L85 PathProgramCache]: Analyzing trace with hash 946475137, now seen corresponding path program 1 times [2025-03-17 11:10:58,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:58,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257441849] [2025-03-17 11:10:58,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:58,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:58,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2945 statements into 1 equivalence classes. [2025-03-17 11:10:58,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2945 of 2945 statements. [2025-03-17 11:10:58,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:58,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 72182 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72182 trivial. 0 not checked. [2025-03-17 11:11:01,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:01,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257441849] [2025-03-17 11:11:01,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257441849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:01,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:01,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:11:01,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633377641] [2025-03-17 11:11:01,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:01,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:01,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:01,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:01,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:01,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 494 [2025-03-17 11:11:01,140 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-17 11:11:01,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:01,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 494 [2025-03-17 11:11:01,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:02,787 INFO L124 PetriNetUnfolderBase]: 46/4808 cut-off events. [2025-03-17 11:11:02,787 INFO L125 PetriNetUnfolderBase]: For 1198/1202 co-relation queries the response was YES. [2025-03-17 11:11:02,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5644 conditions, 4808 events. 46/4808 cut-off events. For 1198/1202 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3034 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-17 11:11:02,794 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 22 selfloop transitions, 2 changer transitions 0/614 dead transitions. [2025-03-17 11:11:02,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 614 transitions, 2277 flow [2025-03-17 11:11:02,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1411 transitions. [2025-03-17 11:11:02,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520917678812416 [2025-03-17 11:11:02,796 INFO L175 Difference]: Start difference. First operand has 583 places, 606 transitions, 2213 flow. Second operand 3 states and 1411 transitions. [2025-03-17 11:11:02,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 614 transitions, 2277 flow [2025-03-17 11:11:02,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 614 transitions, 2267 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:02,813 INFO L231 Difference]: Finished difference. Result has 581 places, 606 transitions, 2211 flow [2025-03-17 11:11:02,814 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-17 11:11:02,814 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 105 predicate places. [2025-03-17 11:11:02,814 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 606 transitions, 2211 flow [2025-03-17 11:11:02,814 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-17 11:11:02,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:02,815 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-17 11:11:02,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:11:02,816 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-17 11:11:02,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:02,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1092738951, now seen corresponding path program 1 times [2025-03-17 11:11:02,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:02,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212469180] [2025-03-17 11:11:02,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:02,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:03,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2945 statements into 1 equivalence classes. [2025-03-17 11:11:03,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2945 of 2945 statements. [2025-03-17 11:11:03,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:03,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:13,864 INFO L134 CoverageAnalysis]: Checked inductivity of 72182 backedges. 36776 proven. 17025 refuted. 0 times theorem prover too weak. 18381 trivial. 0 not checked. [2025-03-17 11:11:13,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:13,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212469180] [2025-03-17 11:11:13,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212469180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:11:13,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727094079] [2025-03-17 11:11:13,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:13,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:11:13,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:11:13,866 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-17 11:11:13,869 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-17 11:11:15,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2945 statements into 1 equivalence classes. [2025-03-17 11:11:16,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2945 of 2945 statements. [2025-03-17 11:11:16,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:16,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:16,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 11747 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 11:11:16,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:11:17,213 INFO L134 CoverageAnalysis]: Checked inductivity of 72182 backedges. 36776 proven. 17025 refuted. 0 times theorem prover too weak. 18381 trivial. 0 not checked. [2025-03-17 11:11:17,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:11:18,724 INFO L134 CoverageAnalysis]: Checked inductivity of 72182 backedges. 36776 proven. 17025 refuted. 0 times theorem prover too weak. 18381 trivial. 0 not checked. [2025-03-17 11:11:18,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727094079] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:11:18,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:11:18,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-03-17 11:11:18,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922121783] [2025-03-17 11:11:18,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:11:18,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-17 11:11:18,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:18,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-17 11:11:18,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-03-17 11:11:18,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 494 [2025-03-17 11:11:18,798 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-17 11:11:18,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:18,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 494 [2025-03-17 11:11:18,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:24,628 INFO L124 PetriNetUnfolderBase]: 15/8582 cut-off events. [2025-03-17 11:11:24,628 INFO L125 PetriNetUnfolderBase]: For 13376/13377 co-relation queries the response was YES. [2025-03-17 11:11:24,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10497 conditions, 8582 events. 15/8582 cut-off events. For 13376/13377 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1224 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-17 11:11:24,640 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 96 selfloop transitions, 270 changer transitions 0/812 dead transitions. [2025-03-17 11:11:24,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 812 transitions, 5129 flow [2025-03-17 11:11:24,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-17 11:11:24,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-03-17 11:11:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 41461 transitions. [2025-03-17 11:11:24,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9325461088618984 [2025-03-17 11:11:24,656 INFO L175 Difference]: Start difference. First operand has 581 places, 606 transitions, 2211 flow. Second operand 90 states and 41461 transitions. [2025-03-17 11:11:24,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 812 transitions, 5129 flow [2025-03-17 11:11:24,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 812 transitions, 5125 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:24,675 INFO L231 Difference]: Finished difference. Result has 684 places, 744 transitions, 4199 flow [2025-03-17 11:11:24,676 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-17 11:11:24,676 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 208 predicate places. [2025-03-17 11:11:24,676 INFO L471 AbstractCegarLoop]: Abstraction has has 684 places, 744 transitions, 4199 flow [2025-03-17 11:11:24,680 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-17 11:11:24,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:24,681 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-17 11:11:24,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 11:11:24,882 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-17 11:11:24,882 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-17 11:11:24,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:24,892 INFO L85 PathProgramCache]: Analyzing trace with hash 626551961, now seen corresponding path program 2 times [2025-03-17 11:11:24,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:24,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714872172] [2025-03-17 11:11:24,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:11:24,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:25,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5645 statements into 2 equivalence classes. [2025-03-17 11:11:25,395 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 178 of 5645 statements. [2025-03-17 11:11:25,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:11:25,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:25,620 INFO L134 CoverageAnalysis]: Checked inductivity of 291217 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291217 trivial. 0 not checked. [2025-03-17 11:11:25,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:25,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714872172] [2025-03-17 11:11:25,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714872172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:25,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:25,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:25,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761380954] [2025-03-17 11:11:25,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:25,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:25,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:25,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:25,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:25,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 494 [2025-03-17 11:11:25,850 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-17 11:11:25,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:25,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 494 [2025-03-17 11:11:25,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:35,502 INFO L124 PetriNetUnfolderBase]: 739/11137 cut-off events. [2025-03-17 11:11:35,503 INFO L125 PetriNetUnfolderBase]: For 3543/3557 co-relation queries the response was YES. [2025-03-17 11:11:35,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17531 conditions, 11137 events. 739/11137 cut-off events. For 3543/3557 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 22717 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-17 11:11:35,531 INFO L140 encePairwiseOnDemand]: 459/494 looper letters, 143 selfloop transitions, 118 changer transitions 0/893 dead transitions. [2025-03-17 11:11:35,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 893 transitions, 5020 flow [2025-03-17 11:11:35,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:35,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:35,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2458 transitions. [2025-03-17 11:11:35,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8292847503373819 [2025-03-17 11:11:35,533 INFO L175 Difference]: Start difference. First operand has 684 places, 744 transitions, 4199 flow. Second operand 6 states and 2458 transitions. [2025-03-17 11:11:35,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 893 transitions, 5020 flow [2025-03-17 11:11:35,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 893 transitions, 4666 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-03-17 11:11:35,566 INFO L231 Difference]: Finished difference. Result has 652 places, 861 transitions, 4620 flow [2025-03-17 11:11:35,567 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-17 11:11:35,567 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 176 predicate places. [2025-03-17 11:11:35,567 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 861 transitions, 4620 flow [2025-03-17 11:11:35,568 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-17 11:11:35,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:35,569 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-17 11:11:35,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:11:35,569 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-17 11:11:35,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:35,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1732995991, now seen corresponding path program 1 times [2025-03-17 11:11:35,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:35,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693781756] [2025-03-17 11:11:35,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:35,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:36,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5659 statements into 1 equivalence classes. [2025-03-17 11:11:36,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5659 of 5659 statements. [2025-03-17 11:11:36,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:36,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:47,042 INFO L134 CoverageAnalysis]: Checked inductivity of 291217 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291217 trivial. 0 not checked. [2025-03-17 11:11:47,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:47,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693781756] [2025-03-17 11:11:47,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693781756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:47,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:47,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:47,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377369719] [2025-03-17 11:11:47,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:47,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:11:47,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:47,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:11:47,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:11:47,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 494 [2025-03-17 11:11:47,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 861 transitions, 4620 flow. Second operand has 5 states, 5 states have (on average 461.6) internal successors, (2308), 5 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:47,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:47,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 494 [2025-03-17 11:11:47,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand