./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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_91-arrayloop2_racefree.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 ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:21:48,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:21:49,029 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:21:49,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:21:49,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:21:49,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:21:49,054 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:21:49,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:21:49,055 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:21:49,055 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:21:49,056 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:21:49,056 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:21:49,056 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:21:49,057 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:21:49,057 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:21:49,057 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:21:49,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:21:49,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:21:49,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:21:49,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:21:49,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:21:49,057 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:21:49,058 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:21:49,058 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:21:49,058 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:21:49,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:21:49,058 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:21:49,058 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:21:49,058 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:21:49,058 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:21:49,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:21:49,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:21:49,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:21:49,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:21:49,059 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:21:49,059 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:21:49,059 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:21:49,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:21:49,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:21:49,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:21:49,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:21:49,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:21:49,059 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 -> ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3 [2025-03-13 22:21:49,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:21:49,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:21:49,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:21:49,310 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:21:49,310 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:21:49,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2025-03-13 22:21:50,444 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05680a0ff/de59772a71914931b77019c87757ad77/FLAG2c54e2f31 [2025-03-13 22:21:50,715 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:21:50,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2025-03-13 22:21:50,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05680a0ff/de59772a71914931b77019c87757ad77/FLAG2c54e2f31 [2025-03-13 22:21:51,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05680a0ff/de59772a71914931b77019c87757ad77 [2025-03-13 22:21:51,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:21:51,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:21:51,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:21:51,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:21:51,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:21:51,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c453938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51, skipping insertion in model container [2025-03-13 22:21:51,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:21:51,398 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:51,402 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:51,402 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:51,403 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:51,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:21:51,458 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:21:51,501 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:51,501 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:51,502 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:51,502 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:51,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:21:51,573 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:21:51,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51 WrapperNode [2025-03-13 22:21:51,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:21:51,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:21:51,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:21:51,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:21:51,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,617 INFO L138 Inliner]: procedures = 279, calls = 120, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 360 [2025-03-13 22:21:51,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:21:51,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:21:51,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:21:51,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:21:51,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,651 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:21:51,660 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:21:51,660 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:21:51,660 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:21:51,661 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:21:51,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:21:51,688 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-13 22:21:51,691 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-13 22:21:51,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 22:21:51,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-13 22:21:51,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:21:51,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-13 22:21:51,710 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:21:51,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:21:51,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:21:51,710 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:21:51,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:21:51,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:21:51,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-13 22:21:51,710 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 22:21:51,710 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 22:21:51,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:21:51,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:21:51,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:21:51,712 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:21:51,829 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:21:51,830 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:21:52,211 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1061: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-13 22:21:52,212 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1061-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-13 22:21:52,352 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:21:52,353 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:21:52,353 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:21:52,392 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:21:52,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:21:52 BoogieIcfgContainer [2025-03-13 22:21:52,395 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:21:52,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:21:52,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:21:52,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:21:52,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:21:51" (1/3) ... [2025-03-13 22:21:52,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b1dc6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:21:52, skipping insertion in model container [2025-03-13 22:21:52,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (2/3) ... [2025-03-13 22:21:52,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b1dc6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:21:52, skipping insertion in model container [2025-03-13 22:21:52,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:21:52" (3/3) ... [2025-03-13 22:21:52,403 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_91-arrayloop2_racefree.i [2025-03-13 22:21:52,415 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:21:52,417 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_91-arrayloop2_racefree.i that has 2 procedures, 382 locations, 1 initial locations, 10 loop locations, and 19 error locations. [2025-03-13 22:21:52,417 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:21:52,526 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:21:52,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 385 places, 401 transitions, 809 flow [2025-03-13 22:21:52,688 INFO L124 PetriNetUnfolderBase]: 19/431 cut-off events. [2025-03-13 22:21:52,689 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:21:52,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 431 events. 19/431 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 959 event pairs, 0 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 251. Up to 4 conditions per place. [2025-03-13 22:21:52,695 INFO L82 GeneralOperation]: Start removeDead. Operand has 385 places, 401 transitions, 809 flow [2025-03-13 22:21:52,701 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 385 places, 401 transitions, 809 flow [2025-03-13 22:21:52,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:21:52,715 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;@342741a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:21:52,716 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-13 22:21:52,734 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:21:52,734 INFO L124 PetriNetUnfolderBase]: 0/118 cut-off events. [2025-03-13 22:21:52,734 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:21:52,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:21:52,735 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] [2025-03-13 22:21:52,735 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:21:52,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:21:52,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1818822606, now seen corresponding path program 1 times [2025-03-13 22:21:52,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:21:52,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034332800] [2025-03-13 22:21:52,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:21:52,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:21:52,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-13 22:21:52,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-13 22:21:52,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:21:52,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:21:53,658 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-13 22:21:53,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:21:53,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034332800] [2025-03-13 22:21:53,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034332800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:21:53,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:21:53,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:21:53,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248148356] [2025-03-13 22:21:53,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:21:53,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:21:53,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:21:53,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:21:53,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:21:54,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 401 [2025-03-13 22:21:54,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 401 transitions, 809 flow. Second operand has 6 states, 6 states have (on average 296.3333333333333) internal successors, (1778), 6 states have internal predecessors, (1778), 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-13 22:21:54,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:21:54,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 401 [2025-03-13 22:21:54,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:21:54,326 INFO L124 PetriNetUnfolderBase]: 319/1593 cut-off events. [2025-03-13 22:21:54,326 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-03-13 22:21:54,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2283 conditions, 1593 events. 319/1593 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10011 event pairs, 288 based on Foata normal form. 77/1540 useless extension candidates. Maximal degree in co-relation 1963. Up to 674 conditions per place. [2025-03-13 22:21:54,338 INFO L140 encePairwiseOnDemand]: 376/401 looper letters, 80 selfloop transitions, 10 changer transitions 0/384 dead transitions. [2025-03-13 22:21:54,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 384 transitions, 955 flow [2025-03-13 22:21:54,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:21:54,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:21:54,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1875 transitions. [2025-03-13 22:21:54,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7793017456359103 [2025-03-13 22:21:54,359 INFO L175 Difference]: Start difference. First operand has 385 places, 401 transitions, 809 flow. Second operand 6 states and 1875 transitions. [2025-03-13 22:21:54,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 384 transitions, 955 flow [2025-03-13 22:21:54,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 384 transitions, 955 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:21:54,374 INFO L231 Difference]: Finished difference. Result has 386 places, 384 transitions, 795 flow [2025-03-13 22:21:54,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=795, PETRI_PLACES=386, PETRI_TRANSITIONS=384} [2025-03-13 22:21:54,380 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 1 predicate places. [2025-03-13 22:21:54,381 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 384 transitions, 795 flow [2025-03-13 22:21:54,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 296.3333333333333) internal successors, (1778), 6 states have internal predecessors, (1778), 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-13 22:21:54,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:21:54,383 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] [2025-03-13 22:21:54,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:21:54,383 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:21:54,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:21:54,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2140736471, now seen corresponding path program 1 times [2025-03-13 22:21:54,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:21:54,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521084312] [2025-03-13 22:21:54,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:21:54,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:21:54,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-13 22:21:54,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-13 22:21:54,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:21:54,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:21:54,472 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-13 22:21:54,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:21:54,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521084312] [2025-03-13 22:21:54,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521084312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:21:54,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:21:54,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:21:54,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878432345] [2025-03-13 22:21:54,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:21:54,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:21:54,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:21:54,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:21:54,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:21:54,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 401 [2025-03-13 22:21:54,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 384 transitions, 795 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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-13 22:21:54,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:21:54,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 401 [2025-03-13 22:21:54,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:21:54,581 INFO L124 PetriNetUnfolderBase]: 15/564 cut-off events. [2025-03-13 22:21:54,581 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-13 22:21:54,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 564 events. 15/564 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1680 event pairs, 8 based on Foata normal form. 1/521 useless extension candidates. Maximal degree in co-relation 402. Up to 34 conditions per place. [2025-03-13 22:21:54,584 INFO L140 encePairwiseOnDemand]: 398/401 looper letters, 15 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2025-03-13 22:21:54,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 385 transitions, 831 flow [2025-03-13 22:21:54,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:21:54,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:21:54,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-03-13 22:21:54,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.940149625935162 [2025-03-13 22:21:54,589 INFO L175 Difference]: Start difference. First operand has 386 places, 384 transitions, 795 flow. Second operand 3 states and 1131 transitions. [2025-03-13 22:21:54,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 385 transitions, 831 flow [2025-03-13 22:21:54,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 385 transitions, 811 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:21:54,611 INFO L231 Difference]: Finished difference. Result has 384 places, 385 transitions, 787 flow [2025-03-13 22:21:54,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=787, PETRI_PLACES=384, PETRI_TRANSITIONS=385} [2025-03-13 22:21:54,612 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, -1 predicate places. [2025-03-13 22:21:54,612 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 385 transitions, 787 flow [2025-03-13 22:21:54,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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-13 22:21:54,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:21:54,613 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] [2025-03-13 22:21:54,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:21:54,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:21:54,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:21:54,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1993860760, now seen corresponding path program 1 times [2025-03-13 22:21:54,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:21:54,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357167702] [2025-03-13 22:21:54,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:21:54,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:21:54,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-13 22:21:54,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-13 22:21:54,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:21:54,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:21:55,017 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-13 22:21:55,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:21:55,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357167702] [2025-03-13 22:21:55,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357167702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:21:55,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:21:55,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:21:55,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800574919] [2025-03-13 22:21:55,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:21:55,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:21:55,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:21:55,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:21:55,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:21:55,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 401 [2025-03-13 22:21:55,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 385 transitions, 787 flow. Second operand has 6 states, 6 states have (on average 296.3333333333333) internal successors, (1778), 6 states have internal predecessors, (1778), 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-13 22:21:55,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:21:55,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 401 [2025-03-13 22:21:55,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:21:55,601 INFO L124 PetriNetUnfolderBase]: 320/1715 cut-off events. [2025-03-13 22:21:55,601 INFO L125 PetriNetUnfolderBase]: For 16/24 co-relation queries the response was YES. [2025-03-13 22:21:55,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2456 conditions, 1715 events. 320/1715 cut-off events. For 16/24 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10756 event pairs, 288 based on Foata normal form. 0/1581 useless extension candidates. Maximal degree in co-relation 2192. Up to 708 conditions per place. [2025-03-13 22:21:55,611 INFO L140 encePairwiseOnDemand]: 389/401 looper letters, 80 selfloop transitions, 10 changer transitions 0/383 dead transitions. [2025-03-13 22:21:55,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 383 transitions, 963 flow [2025-03-13 22:21:55,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:21:55,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:21:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1862 transitions. [2025-03-13 22:21:55,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7738985868661679 [2025-03-13 22:21:55,615 INFO L175 Difference]: Start difference. First operand has 384 places, 385 transitions, 787 flow. Second operand 6 states and 1862 transitions. [2025-03-13 22:21:55,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 383 transitions, 963 flow [2025-03-13 22:21:55,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 383 transitions, 961 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:21:55,620 INFO L231 Difference]: Finished difference. Result has 386 places, 383 transitions, 801 flow [2025-03-13 22:21:55,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=801, PETRI_PLACES=386, PETRI_TRANSITIONS=383} [2025-03-13 22:21:55,622 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 1 predicate places. [2025-03-13 22:21:55,622 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 383 transitions, 801 flow [2025-03-13 22:21:55,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 296.3333333333333) internal successors, (1778), 6 states have internal predecessors, (1778), 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-13 22:21:55,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:21:55,623 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] [2025-03-13 22:21:55,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:21:55,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:21:55,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:21:55,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2075868690, now seen corresponding path program 1 times [2025-03-13 22:21:55,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:21:55,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105681957] [2025-03-13 22:21:55,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:21:55,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:21:55,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-13 22:21:55,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-13 22:21:55,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:21:55,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:21:56,088 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-13 22:21:56,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:21:56,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105681957] [2025-03-13 22:21:56,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105681957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:21:56,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:21:56,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:21:56,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149467409] [2025-03-13 22:21:56,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:21:56,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:21:56,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:21:56,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:21:56,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:21:56,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 401 [2025-03-13 22:21:56,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 383 transitions, 801 flow. Second operand has 6 states, 6 states have (on average 296.6666666666667) internal successors, (1780), 6 states have internal predecessors, (1780), 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-13 22:21:56,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:21:56,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 401 [2025-03-13 22:21:56,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:21:56,654 INFO L124 PetriNetUnfolderBase]: 320/1713 cut-off events. [2025-03-13 22:21:56,654 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-13 22:21:56,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2477 conditions, 1713 events. 320/1713 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10730 event pairs, 288 based on Foata normal form. 0/1581 useless extension candidates. Maximal degree in co-relation 2092. Up to 722 conditions per place. [2025-03-13 22:21:56,661 INFO L140 encePairwiseOnDemand]: 395/401 looper letters, 87 selfloop transitions, 5 changer transitions 0/382 dead transitions. [2025-03-13 22:21:56,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 382 transitions, 983 flow [2025-03-13 22:21:56,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:21:56,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:21:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1857 transitions. [2025-03-13 22:21:56,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7718204488778054 [2025-03-13 22:21:56,666 INFO L175 Difference]: Start difference. First operand has 386 places, 383 transitions, 801 flow. Second operand 6 states and 1857 transitions. [2025-03-13 22:21:56,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 382 transitions, 983 flow [2025-03-13 22:21:56,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 382 transitions, 963 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:21:56,671 INFO L231 Difference]: Finished difference. Result has 385 places, 382 transitions, 789 flow [2025-03-13 22:21:56,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=789, PETRI_PLACES=385, PETRI_TRANSITIONS=382} [2025-03-13 22:21:56,672 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 0 predicate places. [2025-03-13 22:21:56,673 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 382 transitions, 789 flow [2025-03-13 22:21:56,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 296.6666666666667) internal successors, (1780), 6 states have internal predecessors, (1780), 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-13 22:21:56,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:21:56,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:21:56,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:21:56,674 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:21:56,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:21:56,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1176528823, now seen corresponding path program 1 times [2025-03-13 22:21:56,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:21:56,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525627557] [2025-03-13 22:21:56,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:21:56,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:21:56,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-13 22:21:56,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-13 22:21:56,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:21:56,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:21:56,749 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-13 22:21:56,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:21:56,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525627557] [2025-03-13 22:21:56,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525627557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:21:56,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:21:56,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:21:56,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756732581] [2025-03-13 22:21:56,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:21:56,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:21:56,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:21:56,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:21:56,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:21:56,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 401 [2025-03-13 22:21:56,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 382 transitions, 789 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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-13 22:21:56,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:21:56,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 401 [2025-03-13 22:21:56,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:21:56,851 INFO L124 PetriNetUnfolderBase]: 15/746 cut-off events. [2025-03-13 22:21:56,851 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-13 22:21:56,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 746 events. 15/746 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1635 event pairs, 8 based on Foata normal form. 2/702 useless extension candidates. Maximal degree in co-relation 593. Up to 38 conditions per place. [2025-03-13 22:21:56,854 INFO L140 encePairwiseOnDemand]: 398/401 looper letters, 15 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2025-03-13 22:21:56,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 383 transitions, 825 flow [2025-03-13 22:21:56,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:21:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:21:56,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-03-13 22:21:56,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.940149625935162 [2025-03-13 22:21:56,857 INFO L175 Difference]: Start difference. First operand has 385 places, 382 transitions, 789 flow. Second operand 3 states and 1131 transitions. [2025-03-13 22:21:56,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 383 transitions, 825 flow [2025-03-13 22:21:56,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 383 transitions, 815 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:21:56,863 INFO L231 Difference]: Finished difference. Result has 383 places, 383 transitions, 791 flow [2025-03-13 22:21:56,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=791, PETRI_PLACES=383, PETRI_TRANSITIONS=383} [2025-03-13 22:21:56,864 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, -2 predicate places. [2025-03-13 22:21:56,864 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 383 transitions, 791 flow [2025-03-13 22:21:56,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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-13 22:21:56,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:21:56,865 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] [2025-03-13 22:21:56,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:21:56,865 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:21:56,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:21:56,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1851148512, now seen corresponding path program 1 times [2025-03-13 22:21:56,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:21:56,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23143073] [2025-03-13 22:21:56,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:21:56,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:21:56,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-13 22:21:56,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-13 22:21:56,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:21:56,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:21:57,285 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-13 22:21:57,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:21:57,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23143073] [2025-03-13 22:21:57,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23143073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:21:57,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:21:57,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:21:57,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155108793] [2025-03-13 22:21:57,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:21:57,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:21:57,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:21:57,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:21:57,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:21:57,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 401 [2025-03-13 22:21:57,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 383 transitions, 791 flow. Second operand has 6 states, 6 states have (on average 323.5) internal successors, (1941), 6 states have internal predecessors, (1941), 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-13 22:21:57,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:21:57,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 401 [2025-03-13 22:21:57,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:21:57,926 INFO L124 PetriNetUnfolderBase]: 83/1056 cut-off events. [2025-03-13 22:21:57,926 INFO L125 PetriNetUnfolderBase]: For 10/14 co-relation queries the response was YES. [2025-03-13 22:21:57,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1409 conditions, 1056 events. 83/1056 cut-off events. For 10/14 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3645 event pairs, 64 based on Foata normal form. 0/973 useless extension candidates. Maximal degree in co-relation 877. Up to 311 conditions per place. [2025-03-13 22:21:57,930 INFO L140 encePairwiseOnDemand]: 395/401 looper letters, 62 selfloop transitions, 5 changer transitions 0/382 dead transitions. [2025-03-13 22:21:57,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 382 transitions, 923 flow [2025-03-13 22:21:57,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:21:57,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:21:57,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1982 transitions. [2025-03-13 22:21:57,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8237738985868661 [2025-03-13 22:21:57,934 INFO L175 Difference]: Start difference. First operand has 383 places, 383 transitions, 791 flow. Second operand 6 states and 1982 transitions. [2025-03-13 22:21:57,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 382 transitions, 923 flow [2025-03-13 22:21:57,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 382 transitions, 921 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:21:57,939 INFO L231 Difference]: Finished difference. Result has 386 places, 382 transitions, 797 flow [2025-03-13 22:21:57,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=797, PETRI_PLACES=386, PETRI_TRANSITIONS=382} [2025-03-13 22:21:57,940 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 1 predicate places. [2025-03-13 22:21:57,940 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 382 transitions, 797 flow [2025-03-13 22:21:57,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 323.5) internal successors, (1941), 6 states have internal predecessors, (1941), 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-13 22:21:57,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:21:57,941 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] [2025-03-13 22:21:57,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:21:57,941 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:21:57,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:21:57,942 INFO L85 PathProgramCache]: Analyzing trace with hash 664473902, now seen corresponding path program 1 times [2025-03-13 22:21:57,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:21:57,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70332893] [2025-03-13 22:21:57,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:21:57,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:21:57,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-13 22:21:57,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-13 22:21:57,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:21:57,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:21:58,343 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-13 22:21:58,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:21:58,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70332893] [2025-03-13 22:21:58,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70332893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:21:58,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:21:58,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:21:58,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342847085] [2025-03-13 22:21:58,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:21:58,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:21:58,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:21:58,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:21:58,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:21:58,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 401 [2025-03-13 22:21:58,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 382 transitions, 797 flow. Second operand has 6 states, 6 states have (on average 299.3333333333333) internal successors, (1796), 6 states have internal predecessors, (1796), 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-13 22:21:58,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:21:58,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 401 [2025-03-13 22:21:58,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:21:58,920 INFO L124 PetriNetUnfolderBase]: 320/1893 cut-off events. [2025-03-13 22:21:58,920 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-13 22:21:58,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2742 conditions, 1893 events. 320/1893 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10642 event pairs, 288 based on Foata normal form. 0/1761 useless extension candidates. Maximal degree in co-relation 2236. Up to 788 conditions per place. [2025-03-13 22:21:58,928 INFO L140 encePairwiseOnDemand]: 395/401 looper letters, 87 selfloop transitions, 5 changer transitions 0/381 dead transitions. [2025-03-13 22:21:58,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 381 transitions, 979 flow [2025-03-13 22:21:58,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:21:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:21:58,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1857 transitions. [2025-03-13 22:21:58,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7718204488778054 [2025-03-13 22:21:58,931 INFO L175 Difference]: Start difference. First operand has 386 places, 382 transitions, 797 flow. Second operand 6 states and 1857 transitions. [2025-03-13 22:21:58,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 381 transitions, 979 flow [2025-03-13 22:21:58,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 381 transitions, 969 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:21:58,962 INFO L231 Difference]: Finished difference. Result has 385 places, 381 transitions, 795 flow [2025-03-13 22:21:58,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=795, PETRI_PLACES=385, PETRI_TRANSITIONS=381} [2025-03-13 22:21:58,963 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 0 predicate places. [2025-03-13 22:21:58,963 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 381 transitions, 795 flow [2025-03-13 22:21:58,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 299.3333333333333) internal successors, (1796), 6 states have internal predecessors, (1796), 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-13 22:21:58,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:21:58,964 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] [2025-03-13 22:21:58,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:21:58,965 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:21:58,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:21:58,965 INFO L85 PathProgramCache]: Analyzing trace with hash 200467919, now seen corresponding path program 1 times [2025-03-13 22:21:58,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:21:58,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147416000] [2025-03-13 22:21:58,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:21:58,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:21:58,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-13 22:21:59,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-13 22:21:59,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:21:59,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:21:59,427 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-13 22:21:59,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:21:59,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147416000] [2025-03-13 22:21:59,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147416000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:21:59,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:21:59,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:21:59,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603684943] [2025-03-13 22:21:59,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:21:59,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:21:59,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:21:59,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:21:59,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:21:59,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 401 [2025-03-13 22:21:59,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 381 transitions, 795 flow. Second operand has 6 states, 6 states have (on average 304.0) internal successors, (1824), 6 states have internal predecessors, (1824), 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-13 22:21:59,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:21:59,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 401 [2025-03-13 22:21:59,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:21:59,925 INFO L124 PetriNetUnfolderBase]: 320/1889 cut-off events. [2025-03-13 22:21:59,925 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-13 22:21:59,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2722 conditions, 1889 events. 320/1889 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10635 event pairs, 288 based on Foata normal form. 0/1761 useless extension candidates. Maximal degree in co-relation 2252. Up to 772 conditions per place. [2025-03-13 22:21:59,931 INFO L140 encePairwiseOnDemand]: 395/401 looper letters, 83 selfloop transitions, 5 changer transitions 0/380 dead transitions. [2025-03-13 22:21:59,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 380 transitions, 969 flow [2025-03-13 22:21:59,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:21:59,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:21:59,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1877 transitions. [2025-03-13 22:21:59,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7801330008312551 [2025-03-13 22:21:59,934 INFO L175 Difference]: Start difference. First operand has 385 places, 381 transitions, 795 flow. Second operand 6 states and 1877 transitions. [2025-03-13 22:21:59,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 380 transitions, 969 flow [2025-03-13 22:21:59,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 380 transitions, 959 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:21:59,938 INFO L231 Difference]: Finished difference. Result has 384 places, 380 transitions, 793 flow [2025-03-13 22:21:59,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=793, PETRI_PLACES=384, PETRI_TRANSITIONS=380} [2025-03-13 22:21:59,939 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, -1 predicate places. [2025-03-13 22:21:59,939 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 380 transitions, 793 flow [2025-03-13 22:21:59,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 304.0) internal successors, (1824), 6 states have internal predecessors, (1824), 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-13 22:21:59,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:21:59,940 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] [2025-03-13 22:21:59,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:21:59,940 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:21:59,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:21:59,941 INFO L85 PathProgramCache]: Analyzing trace with hash 670185604, now seen corresponding path program 1 times [2025-03-13 22:21:59,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:21:59,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066638660] [2025-03-13 22:21:59,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:21:59,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:21:59,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-13 22:21:59,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-13 22:21:59,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:21:59,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:00,295 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-13 22:22:00,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:00,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066638660] [2025-03-13 22:22:00,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066638660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:00,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:00,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:00,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147229508] [2025-03-13 22:22:00,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:00,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:00,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:00,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:00,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:00,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 401 [2025-03-13 22:22:00,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 380 transitions, 793 flow. Second operand has 6 states, 6 states have (on average 304.0) internal successors, (1824), 6 states have internal predecessors, (1824), 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-13 22:22:00,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:00,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 401 [2025-03-13 22:22:00,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:00,855 INFO L124 PetriNetUnfolderBase]: 320/1885 cut-off events. [2025-03-13 22:22:00,855 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-03-13 22:22:00,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2718 conditions, 1885 events. 320/1885 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10598 event pairs, 288 based on Foata normal form. 0/1761 useless extension candidates. Maximal degree in co-relation 2267. Up to 772 conditions per place. [2025-03-13 22:22:00,861 INFO L140 encePairwiseOnDemand]: 395/401 looper letters, 83 selfloop transitions, 5 changer transitions 0/379 dead transitions. [2025-03-13 22:22:00,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 379 transitions, 967 flow [2025-03-13 22:22:00,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1877 transitions. [2025-03-13 22:22:00,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7801330008312551 [2025-03-13 22:22:00,864 INFO L175 Difference]: Start difference. First operand has 384 places, 380 transitions, 793 flow. Second operand 6 states and 1877 transitions. [2025-03-13 22:22:00,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 379 transitions, 967 flow [2025-03-13 22:22:00,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 379 transitions, 957 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:00,868 INFO L231 Difference]: Finished difference. Result has 383 places, 379 transitions, 791 flow [2025-03-13 22:22:00,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=791, PETRI_PLACES=383, PETRI_TRANSITIONS=379} [2025-03-13 22:22:00,869 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, -2 predicate places. [2025-03-13 22:22:00,869 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 379 transitions, 791 flow [2025-03-13 22:22:00,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 304.0) internal successors, (1824), 6 states have internal predecessors, (1824), 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-13 22:22:00,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:00,870 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] [2025-03-13 22:22:00,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:22:00,870 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:22:00,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:00,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1332645664, now seen corresponding path program 1 times [2025-03-13 22:22:00,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:00,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800989406] [2025-03-13 22:22:00,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:00,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:00,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-13 22:22:00,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-13 22:22:00,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:00,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:01,314 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-13 22:22:01,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:01,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800989406] [2025-03-13 22:22:01,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800989406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:01,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:01,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:01,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261641342] [2025-03-13 22:22:01,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:01,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:01,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:01,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:01,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:01,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 401 [2025-03-13 22:22:01,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 379 transitions, 791 flow. Second operand has 6 states, 6 states have (on average 300.5) internal successors, (1803), 6 states have internal predecessors, (1803), 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-13 22:22:01,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:01,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 401 [2025-03-13 22:22:01,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:01,735 INFO L124 PetriNetUnfolderBase]: 320/1881 cut-off events. [2025-03-13 22:22:01,736 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-13 22:22:01,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2734 conditions, 1881 events. 320/1881 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10596 event pairs, 288 based on Foata normal form. 0/1761 useless extension candidates. Maximal degree in co-relation 2280. Up to 792 conditions per place. [2025-03-13 22:22:01,742 INFO L140 encePairwiseOnDemand]: 395/401 looper letters, 88 selfloop transitions, 5 changer transitions 0/378 dead transitions. [2025-03-13 22:22:01,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 378 transitions, 975 flow [2025-03-13 22:22:01,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1852 transitions. [2025-03-13 22:22:01,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.769742310889443 [2025-03-13 22:22:01,746 INFO L175 Difference]: Start difference. First operand has 383 places, 379 transitions, 791 flow. Second operand 6 states and 1852 transitions. [2025-03-13 22:22:01,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 378 transitions, 975 flow [2025-03-13 22:22:01,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 378 transitions, 965 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:01,750 INFO L231 Difference]: Finished difference. Result has 382 places, 378 transitions, 789 flow [2025-03-13 22:22:01,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=789, PETRI_PLACES=382, PETRI_TRANSITIONS=378} [2025-03-13 22:22:01,751 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, -3 predicate places. [2025-03-13 22:22:01,751 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 378 transitions, 789 flow [2025-03-13 22:22:01,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 300.5) internal successors, (1803), 6 states have internal predecessors, (1803), 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-13 22:22:01,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:01,753 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] [2025-03-13 22:22:01,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:22:01,753 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:22:01,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:01,753 INFO L85 PathProgramCache]: Analyzing trace with hash 842573375, now seen corresponding path program 1 times [2025-03-13 22:22:01,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:01,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843738115] [2025-03-13 22:22:01,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:01,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:01,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-13 22:22:01,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-13 22:22:01,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:01,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:22:01,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:01,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843738115] [2025-03-13 22:22:01,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843738115] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:22:01,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481742109] [2025-03-13 22:22:01,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:01,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:22:01,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:22:01,895 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-13 22:22:01,896 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-13 22:22:02,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-13 22:22:02,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-13 22:22:02,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:02,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:02,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 22:22:02,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:22:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:22:02,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:22:02,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:22:02,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481742109] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:22:02,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:22:02,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 22:22:02,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052970188] [2025-03-13 22:22:02,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:22:02,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:22:02,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:02,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:22:02,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 22:22:02,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 401 [2025-03-13 22:22:02,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 378 transitions, 789 flow. Second operand has 10 states, 10 states have (on average 369.8) internal successors, (3698), 10 states have internal predecessors, (3698), 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-13 22:22:02,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:02,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 401 [2025-03-13 22:22:02,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:02,522 INFO L124 PetriNetUnfolderBase]: 15/910 cut-off events. [2025-03-13 22:22:02,523 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-03-13 22:22:02,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 910 events. 15/910 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1048 event pairs, 8 based on Foata normal form. 4/888 useless extension candidates. Maximal degree in co-relation 799. Up to 38 conditions per place. [2025-03-13 22:22:02,526 INFO L140 encePairwiseOnDemand]: 395/401 looper letters, 19 selfloop transitions, 9 changer transitions 0/386 dead transitions. [2025-03-13 22:22:02,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 386 transitions, 863 flow [2025-03-13 22:22:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:22:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:22:02,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3342 transitions. [2025-03-13 22:22:02,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9260182876142976 [2025-03-13 22:22:02,531 INFO L175 Difference]: Start difference. First operand has 382 places, 378 transitions, 789 flow. Second operand 9 states and 3342 transitions. [2025-03-13 22:22:02,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 386 transitions, 863 flow [2025-03-13 22:22:02,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 386 transitions, 853 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:02,535 INFO L231 Difference]: Finished difference. Result has 388 places, 384 transitions, 829 flow [2025-03-13 22:22:02,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=829, PETRI_PLACES=388, PETRI_TRANSITIONS=384} [2025-03-13 22:22:02,536 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 3 predicate places. [2025-03-13 22:22:02,536 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 384 transitions, 829 flow [2025-03-13 22:22:02,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 369.8) internal successors, (3698), 10 states have internal predecessors, (3698), 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-13 22:22:02,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:02,538 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] [2025-03-13 22:22:02,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 22:22:02,739 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-13 22:22:02,739 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:22:02,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:02,740 INFO L85 PathProgramCache]: Analyzing trace with hash 219878735, now seen corresponding path program 2 times [2025-03-13 22:22:02,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:02,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060502404] [2025-03-13 22:22:02,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:22:02,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:02,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 401 statements into 2 equivalence classes. [2025-03-13 22:22:02,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 401 statements. [2025-03-13 22:22:02,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:22:02,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-03-13 22:22:02,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:02,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060502404] [2025-03-13 22:22:02,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060502404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:02,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:02,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:02,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826640182] [2025-03-13 22:22:02,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:02,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:02,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:02,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:02,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:03,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 401 [2025-03-13 22:22:03,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 384 transitions, 829 flow. Second operand has 6 states, 6 states have (on average 299.1666666666667) internal successors, (1795), 6 states have internal predecessors, (1795), 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-13 22:22:03,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:03,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 401 [2025-03-13 22:22:03,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:03,866 INFO L124 PetriNetUnfolderBase]: 739/3465 cut-off events. [2025-03-13 22:22:03,866 INFO L125 PetriNetUnfolderBase]: For 30/44 co-relation queries the response was YES. [2025-03-13 22:22:03,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5232 conditions, 3465 events. 739/3465 cut-off events. For 30/44 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 22458 event pairs, 323 based on Foata normal form. 4/3220 useless extension candidates. Maximal degree in co-relation 4568. Up to 1429 conditions per place. [2025-03-13 22:22:03,879 INFO L140 encePairwiseOnDemand]: 366/401 looper letters, 127 selfloop transitions, 118 changer transitions 0/533 dead transitions. [2025-03-13 22:22:03,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 533 transitions, 1617 flow [2025-03-13 22:22:03,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:03,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:03,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1992 transitions. [2025-03-13 22:22:03,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.827930174563591 [2025-03-13 22:22:03,883 INFO L175 Difference]: Start difference. First operand has 388 places, 384 transitions, 829 flow. Second operand 6 states and 1992 transitions. [2025-03-13 22:22:03,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 533 transitions, 1617 flow [2025-03-13 22:22:03,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 533 transitions, 1611 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 22:22:03,891 INFO L231 Difference]: Finished difference. Result has 397 places, 501 transitions, 1597 flow [2025-03-13 22:22:03,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1597, PETRI_PLACES=397, PETRI_TRANSITIONS=501} [2025-03-13 22:22:03,893 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 12 predicate places. [2025-03-13 22:22:03,893 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 501 transitions, 1597 flow [2025-03-13 22:22:03,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 299.1666666666667) internal successors, (1795), 6 states have internal predecessors, (1795), 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-13 22:22:03,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:03,894 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] [2025-03-13 22:22:03,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:22:03,894 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:22:03,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:03,895 INFO L85 PathProgramCache]: Analyzing trace with hash 743301452, now seen corresponding path program 1 times [2025-03-13 22:22:03,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:03,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785550179] [2025-03-13 22:22:03,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:03,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:03,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-13 22:22:03,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-13 22:22:03,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:03,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:04,207 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-03-13 22:22:04,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:04,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785550179] [2025-03-13 22:22:04,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785550179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:22:04,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305297220] [2025-03-13 22:22:04,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:04,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:22:04,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:22:04,209 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-13 22:22:04,210 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-13 22:22:04,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-13 22:22:04,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-13 22:22:04,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:04,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:04,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 1472 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-13 22:22:04,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:22:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-13 22:22:04,545 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:22:04,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305297220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:04,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 22:22:04,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-13 22:22:04,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881391350] [2025-03-13 22:22:04,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:04,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:04,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:04,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:04,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:04,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 401 [2025-03-13 22:22:04,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 501 transitions, 1597 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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-13 22:22:04,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:04,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 401 [2025-03-13 22:22:04,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:04,817 INFO L124 PetriNetUnfolderBase]: 280/2138 cut-off events. [2025-03-13 22:22:04,817 INFO L125 PetriNetUnfolderBase]: For 209/251 co-relation queries the response was YES. [2025-03-13 22:22:04,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3205 conditions, 2138 events. 280/2138 cut-off events. For 209/251 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 10883 event pairs, 24 based on Foata normal form. 2/2013 useless extension candidates. Maximal degree in co-relation 2676. Up to 340 conditions per place. [2025-03-13 22:22:04,826 INFO L140 encePairwiseOnDemand]: 398/401 looper letters, 22 selfloop transitions, 3 changer transitions 0/509 dead transitions. [2025-03-13 22:22:04,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 509 transitions, 1663 flow [2025-03-13 22:22:04,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:04,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:04,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2025-03-13 22:22:04,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9459684123025769 [2025-03-13 22:22:04,830 INFO L175 Difference]: Start difference. First operand has 397 places, 501 transitions, 1597 flow. Second operand 3 states and 1138 transitions. [2025-03-13 22:22:04,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 509 transitions, 1663 flow [2025-03-13 22:22:04,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 509 transitions, 1663 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:22:04,839 INFO L231 Difference]: Finished difference. Result has 400 places, 501 transitions, 1608 flow [2025-03-13 22:22:04,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=1597, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1608, PETRI_PLACES=400, PETRI_TRANSITIONS=501} [2025-03-13 22:22:04,840 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 15 predicate places. [2025-03-13 22:22:04,841 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 501 transitions, 1608 flow [2025-03-13 22:22:04,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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-13 22:22:04,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:04,841 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] [2025-03-13 22:22:04,850 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-13 22:22:05,046 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-13 22:22:05,046 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:22:05,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:05,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1846025338, now seen corresponding path program 1 times [2025-03-13 22:22:05,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:05,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498174277] [2025-03-13 22:22:05,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:05,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:05,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-13 22:22:05,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-13 22:22:05,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:05,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-03-13 22:22:05,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:05,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498174277] [2025-03-13 22:22:05,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498174277] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:22:05,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224752909] [2025-03-13 22:22:05,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:05,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:22:05,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:22:05,366 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-13 22:22:05,368 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-13 22:22:05,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-13 22:22:05,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-13 22:22:05,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:05,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:05,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 1525 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 22:22:05,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:22:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 333 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-13 22:22:06,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:22:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 333 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-13 22:22:06,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224752909] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:22:06,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:22:06,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-13 22:22:06,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784044021] [2025-03-13 22:22:06,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:22:06,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-13 22:22:06,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:06,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-13 22:22:06,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-13 22:22:06,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 401 [2025-03-13 22:22:06,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 501 transitions, 1608 flow. Second operand has 19 states, 19 states have (on average 364.57894736842104) internal successors, (6927), 19 states have internal predecessors, (6927), 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-13 22:22:06,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:06,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 401 [2025-03-13 22:22:06,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:07,802 INFO L124 PetriNetUnfolderBase]: 262/3390 cut-off events. [2025-03-13 22:22:07,802 INFO L125 PetriNetUnfolderBase]: For 241/263 co-relation queries the response was YES. [2025-03-13 22:22:07,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4649 conditions, 3390 events. 262/3390 cut-off events. For 241/263 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9516 event pairs, 8 based on Foata normal form. 13/3307 useless extension candidates. Maximal degree in co-relation 2550. Up to 345 conditions per place. [2025-03-13 22:22:07,812 INFO L140 encePairwiseOnDemand]: 390/401 looper letters, 51 selfloop transitions, 68 changer transitions 0/587 dead transitions. [2025-03-13 22:22:07,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 587 transitions, 2256 flow [2025-03-13 22:22:07,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-13 22:22:07,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-13 22:22:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 22938 transitions. [2025-03-13 22:22:07,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9079681748010925 [2025-03-13 22:22:07,827 INFO L175 Difference]: Start difference. First operand has 400 places, 501 transitions, 1608 flow. Second operand 63 states and 22938 transitions. [2025-03-13 22:22:07,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 587 transitions, 2256 flow [2025-03-13 22:22:07,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 587 transitions, 2250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:22:07,838 INFO L231 Difference]: Finished difference. Result has 476 places, 563 transitions, 2122 flow [2025-03-13 22:22:07,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=1602, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=2122, PETRI_PLACES=476, PETRI_TRANSITIONS=563} [2025-03-13 22:22:07,840 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 91 predicate places. [2025-03-13 22:22:07,840 INFO L471 AbstractCegarLoop]: Abstraction has has 476 places, 563 transitions, 2122 flow [2025-03-13 22:22:07,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 364.57894736842104) internal successors, (6927), 19 states have internal predecessors, (6927), 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-13 22:22:07,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:07,846 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] [2025-03-13 22:22:07,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-13 22:22:08,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:22:08,047 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:22:08,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:08,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1498501630, now seen corresponding path program 2 times [2025-03-13 22:22:08,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:08,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624170121] [2025-03-13 22:22:08,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:22:08,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:08,217 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1434 statements into 2 equivalence classes. [2025-03-13 22:22:08,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 116 of 1434 statements. [2025-03-13 22:22:08,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:22:08,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10209 trivial. 0 not checked. [2025-03-13 22:22:08,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:08,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624170121] [2025-03-13 22:22:08,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624170121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:08,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:08,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:08,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852764532] [2025-03-13 22:22:08,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:08,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:22:08,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:08,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:22:08,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:22:08,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 401 [2025-03-13 22:22:08,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 563 transitions, 2122 flow. Second operand has 5 states, 5 states have (on average 370.6) internal successors, (1853), 5 states have internal predecessors, (1853), 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-13 22:22:08,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:08,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 401 [2025-03-13 22:22:08,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:09,084 INFO L124 PetriNetUnfolderBase]: 303/3555 cut-off events. [2025-03-13 22:22:09,085 INFO L125 PetriNetUnfolderBase]: For 626/652 co-relation queries the response was YES. [2025-03-13 22:22:09,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5027 conditions, 3555 events. 303/3555 cut-off events. For 626/652 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10493 event pairs, 0 based on Foata normal form. 9/3461 useless extension candidates. Maximal degree in co-relation 3376. Up to 369 conditions per place. [2025-03-13 22:22:09,101 INFO L140 encePairwiseOnDemand]: 396/401 looper letters, 34 selfloop transitions, 5 changer transitions 0/564 dead transitions. [2025-03-13 22:22:09,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 564 transitions, 2197 flow [2025-03-13 22:22:09,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:09,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2253 transitions. [2025-03-13 22:22:09,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9364089775561097 [2025-03-13 22:22:09,102 INFO L175 Difference]: Start difference. First operand has 476 places, 563 transitions, 2122 flow. Second operand 6 states and 2253 transitions. [2025-03-13 22:22:09,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 564 transitions, 2197 flow [2025-03-13 22:22:09,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 564 transitions, 2118 flow, removed 19 selfloop flow, removed 8 redundant places. [2025-03-13 22:22:09,114 INFO L231 Difference]: Finished difference. Result has 451 places, 540 transitions, 2002 flow [2025-03-13 22:22:09,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=1992, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2002, PETRI_PLACES=451, PETRI_TRANSITIONS=540} [2025-03-13 22:22:09,115 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 66 predicate places. [2025-03-13 22:22:09,115 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 540 transitions, 2002 flow [2025-03-13 22:22:09,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 370.6) internal successors, (1853), 5 states have internal predecessors, (1853), 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-13 22:22:09,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:09,116 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, 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] [2025-03-13 22:22:09,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:22:09,117 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:22:09,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:09,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1744855629, now seen corresponding path program 1 times [2025-03-13 22:22:09,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:09,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922858126] [2025-03-13 22:22:09,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:09,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:09,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1435 statements into 1 equivalence classes. [2025-03-13 22:22:09,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1435 of 1435 statements. [2025-03-13 22:22:09,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:09,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 5430 proven. 2317 refuted. 0 times theorem prover too weak. 2462 trivial. 0 not checked. [2025-03-13 22:22:11,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:11,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922858126] [2025-03-13 22:22:11,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922858126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:22:11,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856092191] [2025-03-13 22:22:11,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:11,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:22:11,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:22:11,449 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-13 22:22:11,450 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-13 22:22:11,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1435 statements into 1 equivalence classes. [2025-03-13 22:22:12,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1435 of 1435 statements. [2025-03-13 22:22:12,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:12,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:12,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 5693 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 22:22:12,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:22:12,980 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 5430 proven. 2317 refuted. 0 times theorem prover too weak. 2462 trivial. 0 not checked. [2025-03-13 22:22:12,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:22:13,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 5430 proven. 2317 refuted. 0 times theorem prover too weak. 2462 trivial. 0 not checked. [2025-03-13 22:22:13,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856092191] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:22:13,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:22:13,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-13 22:22:13,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118854158] [2025-03-13 22:22:13,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:22:13,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-13 22:22:13,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:13,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-13 22:22:13,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-13 22:22:13,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 401 [2025-03-13 22:22:13,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 540 transitions, 2002 flow. Second operand has 34 states, 34 states have (on average 370.1470588235294) internal successors, (12585), 34 states have internal predecessors, (12585), 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-13 22:22:13,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:13,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 401 [2025-03-13 22:22:13,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:16,154 INFO L124 PetriNetUnfolderBase]: 251/5484 cut-off events. [2025-03-13 22:22:16,154 INFO L125 PetriNetUnfolderBase]: For 3363/3384 co-relation queries the response was YES. [2025-03-13 22:22:16,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7217 conditions, 5484 events. 251/5484 cut-off events. For 3363/3384 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 8878 event pairs, 0 based on Foata normal form. 24/5423 useless extension candidates. Maximal degree in co-relation 4986. Up to 345 conditions per place. [2025-03-13 22:22:16,166 INFO L140 encePairwiseOnDemand]: 395/401 looper letters, 49 selfloop transitions, 135 changer transitions 0/641 dead transitions. [2025-03-13 22:22:16,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 641 transitions, 3134 flow [2025-03-13 22:22:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-13 22:22:16,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-13 22:22:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 16642 transitions. [2025-03-13 22:22:16,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9222499307287337 [2025-03-13 22:22:16,174 INFO L175 Difference]: Start difference. First operand has 451 places, 540 transitions, 2002 flow. Second operand 45 states and 16642 transitions. [2025-03-13 22:22:16,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 641 transitions, 3134 flow [2025-03-13 22:22:16,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 641 transitions, 3125 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 22:22:16,190 INFO L231 Difference]: Finished difference. Result has 500 places, 615 transitions, 2867 flow [2025-03-13 22:22:16,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=1993, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2867, PETRI_PLACES=500, PETRI_TRANSITIONS=615} [2025-03-13 22:22:16,191 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 115 predicate places. [2025-03-13 22:22:16,191 INFO L471 AbstractCegarLoop]: Abstraction has has 500 places, 615 transitions, 2867 flow [2025-03-13 22:22:16,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 370.1470588235294) internal successors, (12585), 34 states have internal predecessors, (12585), 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-13 22:22:16,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:16,196 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, 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] [2025-03-13 22:22:16,214 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-13 22:22:16,397 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,SelfDestructingSolverStorable15 [2025-03-13 22:22:16,397 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:22:16,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:16,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1331059277, now seen corresponding path program 2 times [2025-03-13 22:22:16,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:16,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324766830] [2025-03-13 22:22:16,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:22:16,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:16,680 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2875 statements into 2 equivalence classes. [2025-03-13 22:22:16,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 2875 of 2875 statements. [2025-03-13 22:22:16,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 22:22:16,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:26,745 INFO L134 CoverageAnalysis]: Checked inductivity of 48241 backedges. 24806 proven. 11565 refuted. 0 times theorem prover too weak. 11870 trivial. 0 not checked. [2025-03-13 22:22:26,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:26,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324766830] [2025-03-13 22:22:26,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324766830] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:22:26,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25551700] [2025-03-13 22:22:26,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:22:26,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:22:26,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:22:26,748 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:22:26,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 22:22:27,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2875 statements into 2 equivalence classes. [2025-03-13 22:22:28,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 2875 of 2875 statements. [2025-03-13 22:22:28,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 22:22:28,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:28,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 11581 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-13 22:22:28,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:22:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 48241 backedges. 24806 proven. 11565 refuted. 0 times theorem prover too weak. 11870 trivial. 0 not checked. [2025-03-13 22:22:29,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:22:31,116 INFO L134 CoverageAnalysis]: Checked inductivity of 48241 backedges. 24806 proven. 11565 refuted. 0 times theorem prover too weak. 11870 trivial. 0 not checked. [2025-03-13 22:22:31,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25551700] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:22:31,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:22:31,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-03-13 22:22:31,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330272035] [2025-03-13 22:22:31,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:22:31,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-13 22:22:31,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:31,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-13 22:22:31,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-03-13 22:22:31,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 401 [2025-03-13 22:22:31,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 615 transitions, 2867 flow. Second operand has 63 states, 63 states have (on average 370.1111111111111) internal successors, (23317), 63 states have internal predecessors, (23317), 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-13 22:22:31,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:31,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 401 [2025-03-13 22:22:31,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:38,338 INFO L124 PetriNetUnfolderBase]: 251/9534 cut-off events. [2025-03-13 22:22:38,338 INFO L125 PetriNetUnfolderBase]: For 13571/13592 co-relation queries the response was YES. [2025-03-13 22:22:38,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12435 conditions, 9534 events. 251/9534 cut-off events. For 13571/13592 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 8865 event pairs, 0 based on Foata normal form. 45/9494 useless extension candidates. Maximal degree in co-relation 10199. Up to 345 conditions per place. [2025-03-13 22:22:38,372 INFO L140 encePairwiseOnDemand]: 395/401 looper letters, 94 selfloop transitions, 270 changer transitions 0/821 dead transitions. [2025-03-13 22:22:38,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 821 transitions, 5781 flow [2025-03-13 22:22:38,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-13 22:22:38,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-03-13 22:22:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 33269 transitions. [2025-03-13 22:22:38,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9218343031310612 [2025-03-13 22:22:38,501 INFO L175 Difference]: Start difference. First operand has 500 places, 615 transitions, 2867 flow. Second operand 90 states and 33269 transitions. [2025-03-13 22:22:38,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 821 transitions, 5781 flow [2025-03-13 22:22:38,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 821 transitions, 5673 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-03-13 22:22:38,527 INFO L231 Difference]: Finished difference. Result has 587 places, 753 transitions, 4751 flow [2025-03-13 22:22:38,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=2759, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4751, PETRI_PLACES=587, PETRI_TRANSITIONS=753} [2025-03-13 22:22:38,529 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 202 predicate places. [2025-03-13 22:22:38,529 INFO L471 AbstractCegarLoop]: Abstraction has has 587 places, 753 transitions, 4751 flow [2025-03-13 22:22:38,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 370.1111111111111) internal successors, (23317), 63 states have internal predecessors, (23317), 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-13 22:22:38,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:38,535 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, 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] [2025-03-13 22:22:38,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-13 22:22:38,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-13 22:22:38,736 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:22:38,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:38,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1927061171, now seen corresponding path program 3 times [2025-03-13 22:22:38,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:38,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745659350] [2025-03-13 22:22:38,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:22:38,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:39,251 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5575 statements into 35 equivalence classes. [2025-03-13 22:22:39,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 231 of 5575 statements. [2025-03-13 22:22:39,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-13 22:22:39,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:39,395 INFO L134 CoverageAnalysis]: Checked inductivity of 195451 backedges. 0 proven. 99091 refuted. 0 times theorem prover too weak. 96360 trivial. 0 not checked. [2025-03-13 22:22:39,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:39,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745659350] [2025-03-13 22:22:39,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745659350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:22:39,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511913741] [2025-03-13 22:22:39,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:22:39,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:22:39,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:22:39,398 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:22:39,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-13 22:22:41,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5575 statements into 35 equivalence classes. [2025-03-13 22:22:41,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 231 of 5575 statements. [2025-03-13 22:22:41,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-13 22:22:41,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:41,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 22:22:41,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:22:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 195451 backedges. 0 proven. 99091 refuted. 0 times theorem prover too weak. 96360 trivial. 0 not checked. [2025-03-13 22:22:45,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:22:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 195451 backedges. 0 proven. 99091 refuted. 0 times theorem prover too weak. 96360 trivial. 0 not checked. [2025-03-13 22:22:49,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511913741] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:22:49,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:22:49,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-13 22:22:49,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535331718] [2025-03-13 22:22:49,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:22:49,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 22:22:49,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:49,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 22:22:49,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-13 22:22:49,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 401 [2025-03-13 22:22:49,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 753 transitions, 4751 flow. Second operand has 14 states, 14 states have (on average 369.92857142857144) internal successors, (5179), 14 states have internal predecessors, (5179), 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-13 22:22:49,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:49,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 401 [2025-03-13 22:22:49,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:06,674 INFO L124 PetriNetUnfolderBase]: 253/14996 cut-off events. [2025-03-13 22:23:06,674 INFO L125 PetriNetUnfolderBase]: For 6056/6077 co-relation queries the response was YES. [2025-03-13 22:23:06,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19185 conditions, 14996 events. 253/14996 cut-off events. For 6056/6077 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 8079 event pairs, 0 based on Foata normal form. 3/14914 useless extension candidates. Maximal degree in co-relation 16933. Up to 345 conditions per place. [2025-03-13 22:23:06,709 INFO L140 encePairwiseOnDemand]: 395/401 looper letters, 19 selfloop transitions, 15 changer transitions 0/766 dead transitions. [2025-03-13 22:23:06,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 766 transitions, 4865 flow [2025-03-13 22:23:06,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 22:23:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 22:23:06,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 5557 transitions. [2025-03-13 22:23:06,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9238570241064007 [2025-03-13 22:23:06,713 INFO L175 Difference]: Start difference. First operand has 587 places, 753 transitions, 4751 flow. Second operand 15 states and 5557 transitions. [2025-03-13 22:23:06,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 766 transitions, 4865 flow [2025-03-13 22:23:06,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 766 transitions, 4511 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-03-13 22:23:06,752 INFO L231 Difference]: Finished difference. Result has 563 places, 762 transitions, 4487 flow [2025-03-13 22:23:06,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=4397, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=753, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=744, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4487, PETRI_PLACES=563, PETRI_TRANSITIONS=762} [2025-03-13 22:23:06,754 INFO L279 CegarLoopForPetriNet]: 385 programPoint places, 178 predicate places. [2025-03-13 22:23:06,754 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 762 transitions, 4487 flow [2025-03-13 22:23:06,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 369.92857142857144) internal successors, (5179), 14 states have internal predecessors, (5179), 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-13 22:23:06,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:06,758 INFO L206 CegarLoopForPetriNet]: trace histogram [150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2025-03-13 22:23:06,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-13 22:23:06,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-13 22:23:06,958 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-13 22:23:06,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:06,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1177951363, now seen corresponding path program 4 times [2025-03-13 22:23:06,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:06,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375362178] [2025-03-13 22:23:06,994 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 22:23:06,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:08,238 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 13762 statements into 2 equivalence classes. [2025-03-13 22:23:11,367 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13376 of 13762 statements. [2025-03-13 22:23:11,367 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 22:23:11,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat