./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_24-evilcollapse_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_24-evilcollapse_nr.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 085e9170c725dbfce47ad23ff96af1e2e4188372955794675158fde45968fe8a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:25:12,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:25:12,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:25:12,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:25:12,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:25:12,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:25:12,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:25:12,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:25:12,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:25:12,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:25:12,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:25:12,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:25:12,416 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:25:12,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:25:12,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:25:12,416 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:25:12,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:25:12,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:25:12,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:25:12,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:25:12,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:25:12,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:25:12,417 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:25:12,417 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:25:12,417 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:25:12,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:25:12,417 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:25:12,417 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:25:12,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:25:12,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:25:12,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:25:12,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:25:12,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:25:12,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:25:12,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:25:12,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:25:12,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:25:12,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:25:12,418 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:25:12,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:25:12,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:25:12,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:25:12,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:25:12,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:25:12,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:25:12,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:25:12,419 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 085e9170c725dbfce47ad23ff96af1e2e4188372955794675158fde45968fe8a [2025-01-09 21:25:12,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:25:12,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:25:12,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:25:12,615 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:25:12,616 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:25:12,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_24-evilcollapse_nr.i [2025-01-09 21:25:13,785 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ffefebcd9/3767bfe021ab406cb97973bf133fc909/FLAGc1db9f326 [2025-01-09 21:25:14,098 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:25:14,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_24-evilcollapse_nr.i [2025-01-09 21:25:14,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ffefebcd9/3767bfe021ab406cb97973bf133fc909/FLAGc1db9f326 [2025-01-09 21:25:14,118 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ffefebcd9/3767bfe021ab406cb97973bf133fc909 [2025-01-09 21:25:14,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:25:14,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:25:14,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:25:14,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:25:14,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:25:14,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1984e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14, skipping insertion in model container [2025-01-09 21:25:14,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:25:14,406 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:25:14,406 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:25:14,407 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:25:14,407 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:25:14,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:25:14,452 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:25:14,488 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:25:14,488 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:25:14,489 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:25:14,489 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:25:14,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:25:14,548 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:25:14,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14 WrapperNode [2025-01-09 21:25:14,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:25:14,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:25:14,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:25:14,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:25:14,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,588 INFO L138 Inliner]: procedures = 275, calls = 101, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 309 [2025-01-09 21:25:14,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:25:14,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:25:14,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:25:14,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:25:14,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,610 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,612 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:25:14,624 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:25:14,624 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:25:14,624 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:25:14,625 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:25:14,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:25:14,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:25:14,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:25:14,680 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-01-09 21:25:14,680 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-01-09 21:25:14,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 21:25:14,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-09 21:25:14,681 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:25:14,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:25:14,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:25:14,681 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:25:14,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:25:14,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:25:14,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:25:14,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:25:14,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:25:14,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:25:14,683 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:25:14,814 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:25:14,816 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:25:15,280 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:25:15,280 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:25:15,311 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:25:15,311 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:25:15,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:25:15 BoogieIcfgContainer [2025-01-09 21:25:15,311 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:25:15,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:25:15,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:25:15,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:25:15,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:25:14" (1/3) ... [2025-01-09 21:25:15,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf6a49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:25:15, skipping insertion in model container [2025-01-09 21:25:15,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (2/3) ... [2025-01-09 21:25:15,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf6a49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:25:15, skipping insertion in model container [2025-01-09 21:25:15,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:25:15" (3/3) ... [2025-01-09 21:25:15,317 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_24-evilcollapse_nr.i [2025-01-09 21:25:15,327 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:25:15,328 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_24-evilcollapse_nr.i that has 2 procedures, 357 locations, 1 initial locations, 4 loop locations, and 16 error locations. [2025-01-09 21:25:15,328 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:25:15,429 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:25:15,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 429 places, 433 transitions, 874 flow [2025-01-09 21:25:15,562 INFO L124 PetriNetUnfolderBase]: 11/431 cut-off events. [2025-01-09 21:25:15,564 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:15,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 431 events. 11/431 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 784 event pairs, 0 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 358. Up to 2 conditions per place. [2025-01-09 21:25:15,568 INFO L82 GeneralOperation]: Start removeDead. Operand has 429 places, 433 transitions, 874 flow [2025-01-09 21:25:15,572 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 427 places, 431 transitions, 868 flow [2025-01-09 21:25:15,577 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:25:15,583 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;@22faa71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:25:15,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-01-09 21:25:15,613 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:25:15,613 INFO L124 PetriNetUnfolderBase]: 0/114 cut-off events. [2025-01-09 21:25:15,613 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:15,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:15,614 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] [2025-01-09 21:25:15,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:25:15,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:15,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1004013427, now seen corresponding path program 1 times [2025-01-09 21:25:15,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:15,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349935283] [2025-01-09 21:25:15,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:15,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:15,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 21:25:15,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 21:25:15,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:15,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:16,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:16,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349935283] [2025-01-09 21:25:16,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349935283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:16,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:16,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:16,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875559220] [2025-01-09 21:25:16,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:16,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:16,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:16,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:16,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:16,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 433 [2025-01-09 21:25:16,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 431 transitions, 868 flow. Second operand has 6 states, 6 states have (on average 338.3333333333333) internal successors, (2030), 6 states have internal predecessors, (2030), 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-01-09 21:25:16,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:16,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 433 [2025-01-09 21:25:16,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:17,346 INFO L124 PetriNetUnfolderBase]: 450/1908 cut-off events. [2025-01-09 21:25:17,347 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-09 21:25:17,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2815 conditions, 1908 events. 450/1908 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11486 event pairs, 342 based on Foata normal form. 36/1732 useless extension candidates. Maximal degree in co-relation 2477. Up to 854 conditions per place. [2025-01-09 21:25:17,396 INFO L140 encePairwiseOnDemand]: 417/433 looper letters, 80 selfloop transitions, 10 changer transitions 2/425 dead transitions. [2025-01-09 21:25:17,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 425 transitions, 1036 flow [2025-01-09 21:25:17,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2118 transitions. [2025-01-09 21:25:17,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.815242494226328 [2025-01-09 21:25:17,414 INFO L175 Difference]: Start difference. First operand has 427 places, 431 transitions, 868 flow. Second operand 6 states and 2118 transitions. [2025-01-09 21:25:17,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 425 transitions, 1036 flow [2025-01-09 21:25:17,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 425 transitions, 1034 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:25:17,424 INFO L231 Difference]: Finished difference. Result has 428 places, 423 transitions, 870 flow [2025-01-09 21:25:17,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=870, PETRI_PLACES=428, PETRI_TRANSITIONS=423} [2025-01-09 21:25:17,431 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 1 predicate places. [2025-01-09 21:25:17,431 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 423 transitions, 870 flow [2025-01-09 21:25:17,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 338.3333333333333) internal successors, (2030), 6 states have internal predecessors, (2030), 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-01-09 21:25:17,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:17,432 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] [2025-01-09 21:25:17,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:25:17,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:25:17,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:17,433 INFO L85 PathProgramCache]: Analyzing trace with hash -930745059, now seen corresponding path program 1 times [2025-01-09 21:25:17,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:17,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679770723] [2025-01-09 21:25:17,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:17,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:17,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 21:25:17,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 21:25:17,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:17,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:17,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:17,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679770723] [2025-01-09 21:25:17,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679770723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:17,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:17,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:17,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388421062] [2025-01-09 21:25:17,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:17,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:17,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:17,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:17,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:18,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 433 [2025-01-09 21:25:18,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 423 transitions, 870 flow. Second operand has 6 states, 6 states have (on average 338.3333333333333) internal successors, (2030), 6 states have internal predecessors, (2030), 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-01-09 21:25:18,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:18,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 433 [2025-01-09 21:25:18,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:18,376 INFO L124 PetriNetUnfolderBase]: 450/1904 cut-off events. [2025-01-09 21:25:18,377 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:18,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2820 conditions, 1904 events. 450/1904 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11496 event pairs, 342 based on Foata normal form. 0/1696 useless extension candidates. Maximal degree in co-relation 2646. Up to 854 conditions per place. [2025-01-09 21:25:18,385 INFO L140 encePairwiseOnDemand]: 421/433 looper letters, 80 selfloop transitions, 10 changer transitions 0/421 dead transitions. [2025-01-09 21:25:18,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 421 transitions, 1046 flow [2025-01-09 21:25:18,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2114 transitions. [2025-01-09 21:25:18,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8137028483448807 [2025-01-09 21:25:18,392 INFO L175 Difference]: Start difference. First operand has 428 places, 423 transitions, 870 flow. Second operand 6 states and 2114 transitions. [2025-01-09 21:25:18,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 421 transitions, 1046 flow [2025-01-09 21:25:18,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 421 transitions, 1026 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:18,399 INFO L231 Difference]: Finished difference. Result has 424 places, 421 transitions, 866 flow [2025-01-09 21:25:18,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=866, PETRI_PLACES=424, PETRI_TRANSITIONS=421} [2025-01-09 21:25:18,400 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -3 predicate places. [2025-01-09 21:25:18,400 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 421 transitions, 866 flow [2025-01-09 21:25:18,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 338.3333333333333) internal successors, (2030), 6 states have internal predecessors, (2030), 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-01-09 21:25:18,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:18,402 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] [2025-01-09 21:25:18,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:25:18,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:25:18,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:18,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1156264127, now seen corresponding path program 1 times [2025-01-09 21:25:18,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:18,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957875612] [2025-01-09 21:25:18,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:18,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:18,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:25:18,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:25:18,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:18,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:18,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:18,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957875612] [2025-01-09 21:25:18,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957875612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:18,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:18,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:25:18,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048695016] [2025-01-09 21:25:18,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:18,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:25:18,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:18,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:25:18,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:25:18,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 433 [2025-01-09 21:25:18,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 421 transitions, 866 flow. Second operand has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 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-01-09 21:25:18,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:18,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 433 [2025-01-09 21:25:18,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:18,580 INFO L124 PetriNetUnfolderBase]: 30/723 cut-off events. [2025-01-09 21:25:18,580 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:18,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 723 events. 30/723 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2581 event pairs, 18 based on Foata normal form. 1/669 useless extension candidates. Maximal degree in co-relation 493. Up to 45 conditions per place. [2025-01-09 21:25:18,583 INFO L140 encePairwiseOnDemand]: 430/433 looper letters, 11 selfloop transitions, 2 changer transitions 0/422 dead transitions. [2025-01-09 21:25:18,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 422 transitions, 894 flow [2025-01-09 21:25:18,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:25:18,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:25:18,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1265 transitions. [2025-01-09 21:25:18,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9738260200153964 [2025-01-09 21:25:18,586 INFO L175 Difference]: Start difference. First operand has 424 places, 421 transitions, 866 flow. Second operand 3 states and 1265 transitions. [2025-01-09 21:25:18,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 422 transitions, 894 flow [2025-01-09 21:25:18,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 422 transitions, 874 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:18,592 INFO L231 Difference]: Finished difference. Result has 422 places, 422 transitions, 858 flow [2025-01-09 21:25:18,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=422, PETRI_TRANSITIONS=422} [2025-01-09 21:25:18,594 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -5 predicate places. [2025-01-09 21:25:18,594 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 422 transitions, 858 flow [2025-01-09 21:25:18,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 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-01-09 21:25:18,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:18,595 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:18,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:25:18,595 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:25:18,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:18,596 INFO L85 PathProgramCache]: Analyzing trace with hash -548631127, now seen corresponding path program 1 times [2025-01-09 21:25:18,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:18,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012479502] [2025-01-09 21:25:18,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:18,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:18,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 21:25:18,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 21:25:18,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:18,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:19,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:19,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012479502] [2025-01-09 21:25:19,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012479502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:19,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:19,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:19,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628007698] [2025-01-09 21:25:19,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:19,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:19,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:19,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:19,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:19,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 433 [2025-01-09 21:25:19,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 422 transitions, 858 flow. Second operand has 6 states, 6 states have (on average 338.6666666666667) internal successors, (2032), 6 states have internal predecessors, (2032), 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-01-09 21:25:19,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:19,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 433 [2025-01-09 21:25:19,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:19,617 INFO L124 PetriNetUnfolderBase]: 451/2026 cut-off events. [2025-01-09 21:25:19,621 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:25:19,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2986 conditions, 2026 events. 451/2026 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12107 event pairs, 342 based on Foata normal form. 0/1814 useless extension candidates. Maximal degree in co-relation 2726. Up to 902 conditions per place. [2025-01-09 21:25:19,637 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 87 selfloop transitions, 5 changer transitions 0/421 dead transitions. [2025-01-09 21:25:19,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 421 transitions, 1040 flow [2025-01-09 21:25:19,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:19,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2109 transitions. [2025-01-09 21:25:19,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8117782909930716 [2025-01-09 21:25:19,644 INFO L175 Difference]: Start difference. First operand has 422 places, 422 transitions, 858 flow. Second operand 6 states and 2109 transitions. [2025-01-09 21:25:19,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 421 transitions, 1040 flow [2025-01-09 21:25:19,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 421 transitions, 1038 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:25:19,657 INFO L231 Difference]: Finished difference. Result has 425 places, 421 transitions, 864 flow [2025-01-09 21:25:19,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=864, PETRI_PLACES=425, PETRI_TRANSITIONS=421} [2025-01-09 21:25:19,658 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -2 predicate places. [2025-01-09 21:25:19,658 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 421 transitions, 864 flow [2025-01-09 21:25:19,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 338.6666666666667) internal successors, (2032), 6 states have internal predecessors, (2032), 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-01-09 21:25:19,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:19,659 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] [2025-01-09 21:25:19,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:25:19,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:25:19,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:19,663 INFO L85 PathProgramCache]: Analyzing trace with hash 59557119, now seen corresponding path program 1 times [2025-01-09 21:25:19,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:19,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270168126] [2025-01-09 21:25:19,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:19,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:19,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 21:25:19,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 21:25:19,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:19,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:19,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:19,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270168126] [2025-01-09 21:25:19,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270168126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:19,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:19,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:25:19,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962630109] [2025-01-09 21:25:19,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:19,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:25:19,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:19,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:25:19,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:25:19,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 433 [2025-01-09 21:25:19,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 421 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 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-01-09 21:25:19,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:19,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 433 [2025-01-09 21:25:19,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:19,945 INFO L124 PetriNetUnfolderBase]: 30/909 cut-off events. [2025-01-09 21:25:19,948 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:19,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 909 events. 30/909 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2617 event pairs, 18 based on Foata normal form. 2/850 useless extension candidates. Maximal degree in co-relation 571. Up to 49 conditions per place. [2025-01-09 21:25:19,952 INFO L140 encePairwiseOnDemand]: 430/433 looper letters, 11 selfloop transitions, 2 changer transitions 0/422 dead transitions. [2025-01-09 21:25:19,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 422 transitions, 892 flow [2025-01-09 21:25:19,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:25:19,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:25:19,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1265 transitions. [2025-01-09 21:25:19,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9738260200153964 [2025-01-09 21:25:19,958 INFO L175 Difference]: Start difference. First operand has 425 places, 421 transitions, 864 flow. Second operand 3 states and 1265 transitions. [2025-01-09 21:25:19,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 422 transitions, 892 flow [2025-01-09 21:25:19,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 422 transitions, 882 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:19,966 INFO L231 Difference]: Finished difference. Result has 423 places, 422 transitions, 866 flow [2025-01-09 21:25:19,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=866, PETRI_PLACES=423, PETRI_TRANSITIONS=422} [2025-01-09 21:25:19,970 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -4 predicate places. [2025-01-09 21:25:19,970 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 422 transitions, 866 flow [2025-01-09 21:25:19,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 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-01-09 21:25:19,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:19,971 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] [2025-01-09 21:25:19,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:25:19,972 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:25:19,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:19,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1654344533, now seen corresponding path program 1 times [2025-01-09 21:25:19,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:19,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614928174] [2025-01-09 21:25:19,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:19,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:20,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 21:25:20,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 21:25:20,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:20,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:20,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:20,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614928174] [2025-01-09 21:25:20,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614928174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:20,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:20,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:20,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442475564] [2025-01-09 21:25:20,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:20,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:20,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:20,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:20,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:21,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 433 [2025-01-09 21:25:21,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 422 transitions, 866 flow. Second operand has 6 states, 6 states have (on average 373.5) internal successors, (2241), 6 states have internal predecessors, (2241), 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-01-09 21:25:21,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:21,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 433 [2025-01-09 21:25:21,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:21,154 INFO L124 PetriNetUnfolderBase]: 76/1221 cut-off events. [2025-01-09 21:25:21,154 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:25:21,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 1221 events. 76/1221 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4686 event pairs, 42 based on Foata normal form. 0/1125 useless extension candidates. Maximal degree in co-relation 1011. Up to 263 conditions per place. [2025-01-09 21:25:21,158 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 54 selfloop transitions, 5 changer transitions 0/421 dead transitions. [2025-01-09 21:25:21,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 421 transitions, 982 flow [2025-01-09 21:25:21,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:21,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:21,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2274 transitions. [2025-01-09 21:25:21,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8752886836027713 [2025-01-09 21:25:21,162 INFO L175 Difference]: Start difference. First operand has 423 places, 422 transitions, 866 flow. Second operand 6 states and 2274 transitions. [2025-01-09 21:25:21,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 421 transitions, 982 flow [2025-01-09 21:25:21,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 421 transitions, 980 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:25:21,167 INFO L231 Difference]: Finished difference. Result has 426 places, 421 transitions, 872 flow [2025-01-09 21:25:21,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=872, PETRI_PLACES=426, PETRI_TRANSITIONS=421} [2025-01-09 21:25:21,168 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -1 predicate places. [2025-01-09 21:25:21,168 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 421 transitions, 872 flow [2025-01-09 21:25:21,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 373.5) internal successors, (2241), 6 states have internal predecessors, (2241), 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-01-09 21:25:21,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:21,169 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] [2025-01-09 21:25:21,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:25:21,169 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:25:21,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:21,170 INFO L85 PathProgramCache]: Analyzing trace with hash 79890255, now seen corresponding path program 1 times [2025-01-09 21:25:21,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:21,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352163759] [2025-01-09 21:25:21,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:21,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:21,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 21:25:21,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:25:21,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:21,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:21,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:21,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352163759] [2025-01-09 21:25:21,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352163759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:21,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:21,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:21,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188727433] [2025-01-09 21:25:21,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:21,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:21,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:21,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:21,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:21,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 433 [2025-01-09 21:25:21,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 421 transitions, 872 flow. Second operand has 6 states, 6 states have (on average 341.3333333333333) internal successors, (2048), 6 states have internal predecessors, (2048), 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-01-09 21:25:21,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:21,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 433 [2025-01-09 21:25:21,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:22,065 INFO L124 PetriNetUnfolderBase]: 451/2206 cut-off events. [2025-01-09 21:25:22,065 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:25:22,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3270 conditions, 2206 events. 451/2206 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12352 event pairs, 342 based on Foata normal form. 0/1994 useless extension candidates. Maximal degree in co-relation 2769. Up to 968 conditions per place. [2025-01-09 21:25:22,074 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 87 selfloop transitions, 5 changer transitions 0/420 dead transitions. [2025-01-09 21:25:22,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 420 transitions, 1054 flow [2025-01-09 21:25:22,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:22,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:22,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2109 transitions. [2025-01-09 21:25:22,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8117782909930716 [2025-01-09 21:25:22,078 INFO L175 Difference]: Start difference. First operand has 426 places, 421 transitions, 872 flow. Second operand 6 states and 2109 transitions. [2025-01-09 21:25:22,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 420 transitions, 1054 flow [2025-01-09 21:25:22,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 420 transitions, 1044 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:22,083 INFO L231 Difference]: Finished difference. Result has 425 places, 420 transitions, 870 flow [2025-01-09 21:25:22,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=870, PETRI_PLACES=425, PETRI_TRANSITIONS=420} [2025-01-09 21:25:22,084 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -2 predicate places. [2025-01-09 21:25:22,084 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 420 transitions, 870 flow [2025-01-09 21:25:22,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 341.3333333333333) internal successors, (2048), 6 states have internal predecessors, (2048), 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-01-09 21:25:22,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:22,085 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] [2025-01-09 21:25:22,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:25:22,085 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:25:22,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:22,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1191096107, now seen corresponding path program 1 times [2025-01-09 21:25:22,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:22,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558388256] [2025-01-09 21:25:22,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:22,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:22,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 21:25:22,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 21:25:22,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:22,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:22,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:22,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:22,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558388256] [2025-01-09 21:25:22,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558388256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:22,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:22,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:22,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278176594] [2025-01-09 21:25:22,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:22,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:22,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:22,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:22,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:22,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 433 [2025-01-09 21:25:22,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 420 transitions, 870 flow. Second operand has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 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-01-09 21:25:22,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:22,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 433 [2025-01-09 21:25:22,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:23,095 INFO L124 PetriNetUnfolderBase]: 451/2202 cut-off events. [2025-01-09 21:25:23,095 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:25:23,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3250 conditions, 2202 events. 451/2202 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12337 event pairs, 342 based on Foata normal form. 0/1994 useless extension candidates. Maximal degree in co-relation 2785. Up to 952 conditions per place. [2025-01-09 21:25:23,103 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 83 selfloop transitions, 5 changer transitions 0/419 dead transitions. [2025-01-09 21:25:23,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 419 transitions, 1044 flow [2025-01-09 21:25:23,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:23,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2129 transitions. [2025-01-09 21:25:23,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8194765204003079 [2025-01-09 21:25:23,107 INFO L175 Difference]: Start difference. First operand has 425 places, 420 transitions, 870 flow. Second operand 6 states and 2129 transitions. [2025-01-09 21:25:23,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 419 transitions, 1044 flow [2025-01-09 21:25:23,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 419 transitions, 1034 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:23,111 INFO L231 Difference]: Finished difference. Result has 424 places, 419 transitions, 868 flow [2025-01-09 21:25:23,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=868, PETRI_PLACES=424, PETRI_TRANSITIONS=419} [2025-01-09 21:25:23,112 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -3 predicate places. [2025-01-09 21:25:23,112 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 419 transitions, 868 flow [2025-01-09 21:25:23,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 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-01-09 21:25:23,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:23,114 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:23,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:25:23,114 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:25:23,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:23,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1343605523, now seen corresponding path program 1 times [2025-01-09 21:25:23,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:23,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9768645] [2025-01-09 21:25:23,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:23,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:23,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 21:25:23,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 21:25:23,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:23,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:23,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:23,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9768645] [2025-01-09 21:25:23,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9768645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:23,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:23,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:23,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92151468] [2025-01-09 21:25:23,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:23,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:23,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:23,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:23,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:23,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 433 [2025-01-09 21:25:23,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 419 transitions, 868 flow. Second operand has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 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-01-09 21:25:23,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:23,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 433 [2025-01-09 21:25:23,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:23,985 INFO L124 PetriNetUnfolderBase]: 451/2198 cut-off events. [2025-01-09 21:25:23,985 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:23,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3246 conditions, 2198 events. 451/2198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12277 event pairs, 342 based on Foata normal form. 0/1994 useless extension candidates. Maximal degree in co-relation 2800. Up to 952 conditions per place. [2025-01-09 21:25:23,994 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 83 selfloop transitions, 5 changer transitions 0/418 dead transitions. [2025-01-09 21:25:23,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 418 transitions, 1042 flow [2025-01-09 21:25:23,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2129 transitions. [2025-01-09 21:25:23,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8194765204003079 [2025-01-09 21:25:23,998 INFO L175 Difference]: Start difference. First operand has 424 places, 419 transitions, 868 flow. Second operand 6 states and 2129 transitions. [2025-01-09 21:25:23,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 418 transitions, 1042 flow [2025-01-09 21:25:24,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 418 transitions, 1032 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:24,003 INFO L231 Difference]: Finished difference. Result has 423 places, 418 transitions, 866 flow [2025-01-09 21:25:24,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=866, PETRI_PLACES=423, PETRI_TRANSITIONS=418} [2025-01-09 21:25:24,004 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -4 predicate places. [2025-01-09 21:25:24,004 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 418 transitions, 866 flow [2025-01-09 21:25:24,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 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-01-09 21:25:24,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:24,005 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:24,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:25:24,006 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:25:24,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:24,006 INFO L85 PathProgramCache]: Analyzing trace with hash -953601274, now seen corresponding path program 1 times [2025-01-09 21:25:24,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:24,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165714801] [2025-01-09 21:25:24,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:24,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:24,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 21:25:24,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 21:25:24,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:24,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:24,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:25:24,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:24,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165714801] [2025-01-09 21:25:24,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165714801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:24,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:24,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:24,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091044934] [2025-01-09 21:25:24,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:24,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:24,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:24,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:24,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:24,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 433 [2025-01-09 21:25:24,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 418 transitions, 866 flow. Second operand has 6 states, 6 states have (on average 342.5) internal successors, (2055), 6 states have internal predecessors, (2055), 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-01-09 21:25:24,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:24,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 433 [2025-01-09 21:25:24,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:24,970 INFO L124 PetriNetUnfolderBase]: 451/2194 cut-off events. [2025-01-09 21:25:24,971 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:25:24,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3262 conditions, 2194 events. 451/2194 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12305 event pairs, 342 based on Foata normal form. 0/1994 useless extension candidates. Maximal degree in co-relation 2813. Up to 972 conditions per place. [2025-01-09 21:25:24,978 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 88 selfloop transitions, 5 changer transitions 0/417 dead transitions. [2025-01-09 21:25:24,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 417 transitions, 1050 flow [2025-01-09 21:25:24,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2104 transitions. [2025-01-09 21:25:25,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8098537336412626 [2025-01-09 21:25:25,017 INFO L175 Difference]: Start difference. First operand has 423 places, 418 transitions, 866 flow. Second operand 6 states and 2104 transitions. [2025-01-09 21:25:25,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 417 transitions, 1050 flow [2025-01-09 21:25:25,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 417 transitions, 1040 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:25,023 INFO L231 Difference]: Finished difference. Result has 422 places, 417 transitions, 864 flow [2025-01-09 21:25:25,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=864, PETRI_PLACES=422, PETRI_TRANSITIONS=417} [2025-01-09 21:25:25,025 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -5 predicate places. [2025-01-09 21:25:25,025 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 417 transitions, 864 flow [2025-01-09 21:25:25,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 342.5) internal successors, (2055), 6 states have internal predecessors, (2055), 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-01-09 21:25:25,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:25,026 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:25,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:25:25,027 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:25:25,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:25,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1980143527, now seen corresponding path program 1 times [2025-01-09 21:25:25,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:25,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147133426] [2025-01-09 21:25:25,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:25,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:25,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 21:25:25,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 21:25:25,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:25,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:25:25,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:25,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147133426] [2025-01-09 21:25:25,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147133426] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:25:25,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664219419] [2025-01-09 21:25:25,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:25,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:25:25,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:25:25,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:25:25,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:25:25,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 21:25:25,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 21:25:25,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:25,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:25,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:25:25,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:25:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:25:25,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:25:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:25:25,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664219419] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:25:25,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:25:25,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:25:25,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225766057] [2025-01-09 21:25:25,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:25:25,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:25:25,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:25,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:25:25,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:25:25,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 433 [2025-01-09 21:25:25,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 417 transitions, 864 flow. Second operand has 10 states, 10 states have (on average 415.8) internal successors, (4158), 10 states have internal predecessors, (4158), 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-01-09 21:25:25,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:25,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 433 [2025-01-09 21:25:25,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:25,807 INFO L124 PetriNetUnfolderBase]: 30/1073 cut-off events. [2025-01-09 21:25:25,808 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:25:25,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 1073 events. 30/1073 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1990 event pairs, 18 based on Foata normal form. 4/1036 useless extension candidates. Maximal degree in co-relation 564. Up to 49 conditions per place. [2025-01-09 21:25:25,810 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 15 selfloop transitions, 9 changer transitions 0/425 dead transitions. [2025-01-09 21:25:25,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 425 transitions, 930 flow [2025-01-09 21:25:25,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:25:25,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:25:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3752 transitions. [2025-01-09 21:25:25,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627918911983577 [2025-01-09 21:25:25,815 INFO L175 Difference]: Start difference. First operand has 422 places, 417 transitions, 864 flow. Second operand 9 states and 3752 transitions. [2025-01-09 21:25:25,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 425 transitions, 930 flow [2025-01-09 21:25:25,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 425 transitions, 920 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:25,820 INFO L231 Difference]: Finished difference. Result has 428 places, 423 transitions, 904 flow [2025-01-09 21:25:25,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=904, PETRI_PLACES=428, PETRI_TRANSITIONS=423} [2025-01-09 21:25:25,821 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 1 predicate places. [2025-01-09 21:25:25,821 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 423 transitions, 904 flow [2025-01-09 21:25:25,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 415.8) internal successors, (4158), 10 states have internal predecessors, (4158), 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-01-09 21:25:25,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:25,822 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] [2025-01-09 21:25:25,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 21:25:26,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 21:25:26,027 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:25:26,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:26,028 INFO L85 PathProgramCache]: Analyzing trace with hash 999765669, now seen corresponding path program 2 times [2025-01-09 21:25:26,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:26,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663786015] [2025-01-09 21:25:26,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:25:26,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:26,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 407 statements into 2 equivalence classes. [2025-01-09 21:25:26,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 108 of 407 statements. [2025-01-09 21:25:26,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:25:26,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 21:25:26,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:26,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663786015] [2025-01-09 21:25:26,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663786015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:26,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:26,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:26,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842899188] [2025-01-09 21:25:26,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:26,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:26,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:26,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:26,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:27,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 433 [2025-01-09 21:25:27,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 423 transitions, 904 flow. Second operand has 6 states, 6 states have (on average 376.3333333333333) internal successors, (2258), 6 states have internal predecessors, (2258), 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-01-09 21:25:27,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:27,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 433 [2025-01-09 21:25:27,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:27,407 INFO L124 PetriNetUnfolderBase]: 76/1388 cut-off events. [2025-01-09 21:25:27,407 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:25:27,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1776 conditions, 1388 events. 76/1388 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4065 event pairs, 42 based on Foata normal form. 0/1305 useless extension candidates. Maximal degree in co-relation 1133. Up to 307 conditions per place. [2025-01-09 21:25:27,413 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 54 selfloop transitions, 5 changer transitions 0/422 dead transitions. [2025-01-09 21:25:27,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 422 transitions, 1020 flow [2025-01-09 21:25:27,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:27,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2274 transitions. [2025-01-09 21:25:27,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8752886836027713 [2025-01-09 21:25:27,417 INFO L175 Difference]: Start difference. First operand has 428 places, 423 transitions, 904 flow. Second operand 6 states and 2274 transitions. [2025-01-09 21:25:27,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 422 transitions, 1020 flow [2025-01-09 21:25:27,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 422 transitions, 1014 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 21:25:27,423 INFO L231 Difference]: Finished difference. Result has 431 places, 422 transitions, 906 flow [2025-01-09 21:25:27,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=906, PETRI_PLACES=431, PETRI_TRANSITIONS=422} [2025-01-09 21:25:27,428 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 4 predicate places. [2025-01-09 21:25:27,428 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 422 transitions, 906 flow [2025-01-09 21:25:27,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 376.3333333333333) internal successors, (2258), 6 states have internal predecessors, (2258), 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-01-09 21:25:27,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:27,429 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] [2025-01-09 21:25:27,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:25:27,429 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:25:27,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:27,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1853984689, now seen corresponding path program 1 times [2025-01-09 21:25:27,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:27,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668623555] [2025-01-09 21:25:27,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:27,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:27,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-01-09 21:25:27,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-01-09 21:25:27,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:27,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-01-09 21:25:27,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:27,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668623555] [2025-01-09 21:25:27,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668623555] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:25:27,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156464298] [2025-01-09 21:25:27,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:27,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:25:27,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:25:27,739 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:25:27,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:25:27,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-01-09 21:25:28,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-01-09 21:25:28,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:28,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:28,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 1456 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:25:28,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:25:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 333 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 21:25:28,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:25:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 333 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 21:25:28,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156464298] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:25:28,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:25:28,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-01-09 21:25:28,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039222585] [2025-01-09 21:25:28,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:25:28,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 21:25:28,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:28,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 21:25:28,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-01-09 21:25:28,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 433 [2025-01-09 21:25:28,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 422 transitions, 906 flow. Second operand has 19 states, 19 states have (on average 410.5263157894737) internal successors, (7800), 19 states have internal predecessors, (7800), 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-01-09 21:25:28,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:28,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 433 [2025-01-09 21:25:28,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:29,804 INFO L124 PetriNetUnfolderBase]: 31/2452 cut-off events. [2025-01-09 21:25:29,804 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-01-09 21:25:29,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2763 conditions, 2452 events. 31/2452 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1985 event pairs, 18 based on Foata normal form. 13/2425 useless extension candidates. Maximal degree in co-relation 2363. Up to 51 conditions per place. [2025-01-09 21:25:29,807 INFO L140 encePairwiseOnDemand]: 422/433 looper letters, 47 selfloop transitions, 68 changer transitions 0/508 dead transitions. [2025-01-09 21:25:29,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 508 transitions, 1546 flow [2025-01-09 21:25:29,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-01-09 21:25:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-01-09 21:25:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 25832 transitions. [2025-01-09 21:25:29,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9469555335606143 [2025-01-09 21:25:29,825 INFO L175 Difference]: Start difference. First operand has 431 places, 422 transitions, 906 flow. Second operand 63 states and 25832 transitions. [2025-01-09 21:25:29,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 508 transitions, 1546 flow [2025-01-09 21:25:29,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 488 places, 508 transitions, 1536 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:29,831 INFO L231 Difference]: Finished difference. Result has 504 places, 484 transitions, 1416 flow [2025-01-09 21:25:29,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1416, PETRI_PLACES=504, PETRI_TRANSITIONS=484} [2025-01-09 21:25:29,832 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 77 predicate places. [2025-01-09 21:25:29,832 INFO L471 AbstractCegarLoop]: Abstraction has has 504 places, 484 transitions, 1416 flow [2025-01-09 21:25:29,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 410.5263157894737) internal successors, (7800), 19 states have internal predecessors, (7800), 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-01-09 21:25:29,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:29,834 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] [2025-01-09 21:25:29,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 21:25:30,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:25:30,035 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:25:30,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:30,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1337777599, now seen corresponding path program 2 times [2025-01-09 21:25:30,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:30,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596557004] [2025-01-09 21:25:30,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:25:30,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:30,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1426 statements into 2 equivalence classes. [2025-01-09 21:25:30,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 108 of 1426 statements. [2025-01-09 21:25:30,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:25:30,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10209 trivial. 0 not checked. [2025-01-09 21:25:30,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:30,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596557004] [2025-01-09 21:25:30,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596557004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:30,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:30,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:30,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130660] [2025-01-09 21:25:30,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:30,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:30,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:30,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:30,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:31,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 433 [2025-01-09 21:25:31,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 484 transitions, 1416 flow. Second operand has 6 states, 6 states have (on average 376.3333333333333) internal successors, (2258), 6 states have internal predecessors, (2258), 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-01-09 21:25:31,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:31,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 433 [2025-01-09 21:25:31,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:31,923 INFO L124 PetriNetUnfolderBase]: 77/2767 cut-off events. [2025-01-09 21:25:31,923 INFO L125 PetriNetUnfolderBase]: For 432/432 co-relation queries the response was YES. [2025-01-09 21:25:31,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3861 conditions, 2767 events. 77/2767 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4040 event pairs, 42 based on Foata normal form. 0/2685 useless extension candidates. Maximal degree in co-relation 1813. Up to 735 conditions per place. [2025-01-09 21:25:31,929 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 54 selfloop transitions, 5 changer transitions 0/483 dead transitions. [2025-01-09 21:25:31,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 483 transitions, 1532 flow [2025-01-09 21:25:31,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:31,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:31,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2274 transitions. [2025-01-09 21:25:31,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8752886836027713 [2025-01-09 21:25:31,931 INFO L175 Difference]: Start difference. First operand has 504 places, 484 transitions, 1416 flow. Second operand 6 states and 2274 transitions. [2025-01-09 21:25:31,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 508 places, 483 transitions, 1532 flow [2025-01-09 21:25:31,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 501 places, 483 transitions, 1456 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-01-09 21:25:31,939 INFO L231 Difference]: Finished difference. Result has 501 places, 483 transitions, 1348 flow [2025-01-09 21:25:31,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1348, PETRI_PLACES=501, PETRI_TRANSITIONS=483} [2025-01-09 21:25:31,940 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 74 predicate places. [2025-01-09 21:25:31,940 INFO L471 AbstractCegarLoop]: Abstraction has has 501 places, 483 transitions, 1348 flow [2025-01-09 21:25:31,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 376.3333333333333) internal successors, (2258), 6 states have internal predecessors, (2258), 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-01-09 21:25:31,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:31,941 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:31,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:25:31,942 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:25:31,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:31,944 INFO L85 PathProgramCache]: Analyzing trace with hash -635940151, now seen corresponding path program 1 times [2025-01-09 21:25:31,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:31,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109485429] [2025-01-09 21:25:31,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:31,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:32,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1460 statements into 1 equivalence classes. [2025-01-09 21:25:32,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1460 of 1460 statements. [2025-01-09 21:25:32,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:32,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 10279 backedges. 5465 proven. 2317 refuted. 0 times theorem prover too weak. 2497 trivial. 0 not checked. [2025-01-09 21:25:34,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:34,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109485429] [2025-01-09 21:25:34,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109485429] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:25:34,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555304521] [2025-01-09 21:25:34,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:34,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:25:34,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:25:34,297 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:25:34,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 21:25:34,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1460 statements into 1 equivalence classes. [2025-01-09 21:25:35,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1460 of 1460 statements. [2025-01-09 21:25:35,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:35,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:35,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 5698 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 21:25:35,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:25:36,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10279 backedges. 5465 proven. 2317 refuted. 0 times theorem prover too weak. 2497 trivial. 0 not checked. [2025-01-09 21:25:36,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:25:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 10279 backedges. 5465 proven. 2317 refuted. 0 times theorem prover too weak. 2497 trivial. 0 not checked. [2025-01-09 21:25:36,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555304521] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:25:36,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:25:36,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-01-09 21:25:36,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422831269] [2025-01-09 21:25:36,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:25:36,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 21:25:36,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:36,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 21:25:36,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 21:25:36,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 433 [2025-01-09 21:25:36,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 483 transitions, 1348 flow. Second operand has 34 states, 34 states have (on average 416.1764705882353) internal successors, (14150), 34 states have internal predecessors, (14150), 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-01-09 21:25:36,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:36,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 433 [2025-01-09 21:25:36,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:38,727 INFO L124 PetriNetUnfolderBase]: 31/4611 cut-off events. [2025-01-09 21:25:38,728 INFO L125 PetriNetUnfolderBase]: For 3207/3207 co-relation queries the response was YES. [2025-01-09 21:25:38,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5422 conditions, 4611 events. 31/4611 cut-off events. For 3207/3207 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1982 event pairs, 18 based on Foata normal form. 24/4596 useless extension candidates. Maximal degree in co-relation 5381. Up to 78 conditions per place. [2025-01-09 21:25:38,734 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 47 selfloop transitions, 135 changer transitions 0/584 dead transitions. [2025-01-09 21:25:38,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 584 transitions, 2476 flow [2025-01-09 21:25:38,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-01-09 21:25:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-01-09 21:25:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 18710 transitions. [2025-01-09 21:25:38,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9602258147292789 [2025-01-09 21:25:38,741 INFO L175 Difference]: Start difference. First operand has 501 places, 483 transitions, 1348 flow. Second operand 45 states and 18710 transitions. [2025-01-09 21:25:38,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 584 transitions, 2476 flow [2025-01-09 21:25:38,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 584 transitions, 2466 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:38,754 INFO L231 Difference]: Finished difference. Result has 549 places, 558 transitions, 2212 flow [2025-01-09 21:25:38,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2212, PETRI_PLACES=549, PETRI_TRANSITIONS=558} [2025-01-09 21:25:38,755 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 122 predicate places. [2025-01-09 21:25:38,755 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 558 transitions, 2212 flow [2025-01-09 21:25:38,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 416.1764705882353) internal successors, (14150), 34 states have internal predecessors, (14150), 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-01-09 21:25:38,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:38,759 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:38,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 21:25:38,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:25:38,963 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:25:38,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:38,967 INFO L85 PathProgramCache]: Analyzing trace with hash 836801737, now seen corresponding path program 2 times [2025-01-09 21:25:38,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:38,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82894391] [2025-01-09 21:25:38,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:25:38,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:39,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2900 statements into 2 equivalence classes. [2025-01-09 21:25:39,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 142 of 2900 statements. [2025-01-09 21:25:39,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:25:39,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:39,545 INFO L134 CoverageAnalysis]: Checked inductivity of 48391 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48391 trivial. 0 not checked. [2025-01-09 21:25:39,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:39,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82894391] [2025-01-09 21:25:39,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82894391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:39,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:39,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:39,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358142905] [2025-01-09 21:25:39,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:39,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:39,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:39,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:39,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:40,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 433 [2025-01-09 21:25:40,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 558 transitions, 2212 flow. Second operand has 6 states, 6 states have (on average 377.5) internal successors, (2265), 6 states have internal predecessors, (2265), 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-01-09 21:25:40,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:40,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 433 [2025-01-09 21:25:40,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:43,107 INFO L124 PetriNetUnfolderBase]: 201/5512 cut-off events. [2025-01-09 21:25:43,108 INFO L125 PetriNetUnfolderBase]: For 1218/1218 co-relation queries the response was YES. [2025-01-09 21:25:43,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7962 conditions, 5512 events. 201/5512 cut-off events. For 1218/1218 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8978 event pairs, 54 based on Foata normal form. 0/5368 useless extension candidates. Maximal degree in co-relation 4118. Up to 1548 conditions per place. [2025-01-09 21:25:43,122 INFO L140 encePairwiseOnDemand]: 421/433 looper letters, 71 selfloop transitions, 23 changer transitions 0/593 dead transitions. [2025-01-09 21:25:43,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 593 transitions, 2478 flow [2025-01-09 21:25:43,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2315 transitions. [2025-01-09 21:25:43,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8910700538876059 [2025-01-09 21:25:43,128 INFO L175 Difference]: Start difference. First operand has 549 places, 558 transitions, 2212 flow. Second operand 6 states and 2315 transitions. [2025-01-09 21:25:43,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 593 transitions, 2478 flow [2025-01-09 21:25:43,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 593 transitions, 2370 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-01-09 21:25:43,144 INFO L231 Difference]: Finished difference. Result has 541 places, 580 transitions, 2262 flow [2025-01-09 21:25:43,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2262, PETRI_PLACES=541, PETRI_TRANSITIONS=580} [2025-01-09 21:25:43,145 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 114 predicate places. [2025-01-09 21:25:43,145 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 580 transitions, 2262 flow [2025-01-09 21:25:43,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 377.5) internal successors, (2265), 6 states have internal predecessors, (2265), 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-01-09 21:25:43,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:43,146 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:43,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:25:43,147 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:25:43,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:43,153 INFO L85 PathProgramCache]: Analyzing trace with hash 684512123, now seen corresponding path program 1 times [2025-01-09 21:25:43,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:43,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289119936] [2025-01-09 21:25:43,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:43,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:43,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2906 statements into 1 equivalence classes. [2025-01-09 21:25:43,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2906 of 2906 statements. [2025-01-09 21:25:43,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:43,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 48391 backedges. 24881 proven. 11565 refuted. 0 times theorem prover too weak. 11945 trivial. 0 not checked. [2025-01-09 21:25:53,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:53,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289119936] [2025-01-09 21:25:53,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289119936] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:25:53,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052474215] [2025-01-09 21:25:53,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:53,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:25:53,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:25:53,303 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:25:53,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 21:25:54,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2906 statements into 1 equivalence classes. [2025-01-09 21:25:55,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2906 of 2906 statements. [2025-01-09 21:25:55,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:55,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:55,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 11604 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 21:25:55,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:25:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 48391 backedges. 24881 proven. 11565 refuted. 0 times theorem prover too weak. 11945 trivial. 0 not checked. [2025-01-09 21:25:56,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:25:58,481 INFO L134 CoverageAnalysis]: Checked inductivity of 48391 backedges. 24881 proven. 11565 refuted. 0 times theorem prover too weak. 11945 trivial. 0 not checked. [2025-01-09 21:25:58,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052474215] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:25:58,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:25:58,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-01-09 21:25:58,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476656491] [2025-01-09 21:25:58,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:25:58,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-01-09 21:25:58,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:58,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-01-09 21:25:58,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-01-09 21:25:58,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 433 [2025-01-09 21:25:58,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 580 transitions, 2262 flow. Second operand has 63 states, 63 states have (on average 416.14285714285717) internal successors, (26217), 63 states have internal predecessors, (26217), 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-01-09 21:25:58,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:58,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 433 [2025-01-09 21:25:58,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:06,824 INFO L124 PetriNetUnfolderBase]: 187/9720 cut-off events. [2025-01-09 21:26:06,824 INFO L125 PetriNetUnfolderBase]: For 13429/13433 co-relation queries the response was YES. [2025-01-09 21:26:06,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12063 conditions, 9720 events. 187/9720 cut-off events. For 13429/13433 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9663 event pairs, 55 based on Foata normal form. 45/9595 useless extension candidates. Maximal degree in co-relation 10722. Up to 168 conditions per place. [2025-01-09 21:26:06,844 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 92 selfloop transitions, 270 changer transitions 0/786 dead transitions. [2025-01-09 21:26:06,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 786 transitions, 5172 flow [2025-01-09 21:26:06,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-01-09 21:26:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-01-09 21:26:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 37407 transitions. [2025-01-09 21:26:06,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9598922247882987 [2025-01-09 21:26:06,856 INFO L175 Difference]: Start difference. First operand has 541 places, 580 transitions, 2262 flow. Second operand 90 states and 37407 transitions. [2025-01-09 21:26:06,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 786 transitions, 5172 flow [2025-01-09 21:26:06,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 786 transitions, 5172 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:26:06,880 INFO L231 Difference]: Finished difference. Result has 646 places, 718 transitions, 4254 flow [2025-01-09 21:26:06,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=2262, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4254, PETRI_PLACES=646, PETRI_TRANSITIONS=718} [2025-01-09 21:26:06,881 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 219 predicate places. [2025-01-09 21:26:06,881 INFO L471 AbstractCegarLoop]: Abstraction has has 646 places, 718 transitions, 4254 flow [2025-01-09 21:26:06,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 416.14285714285717) internal successors, (26217), 63 states have internal predecessors, (26217), 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-01-09 21:26:06,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:06,887 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:06,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 21:26:07,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 21:26:07,091 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:26:07,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:07,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1881448773, now seen corresponding path program 2 times [2025-01-09 21:26:07,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:07,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145621656] [2025-01-09 21:26:07,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:26:07,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:07,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5606 statements into 2 equivalence classes. [2025-01-09 21:26:07,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 148 of 5606 statements. [2025-01-09 21:26:07,642 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:26:07,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 195751 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195751 trivial. 0 not checked. [2025-01-09 21:26:07,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:07,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145621656] [2025-01-09 21:26:07,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145621656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:07,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:07,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:07,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014502112] [2025-01-09 21:26:07,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:07,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:26:07,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:07,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:26:07,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:26:08,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 433 [2025-01-09 21:26:08,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 646 places, 718 transitions, 4254 flow. Second operand has 6 states, 6 states have (on average 377.6666666666667) internal successors, (2266), 6 states have internal predecessors, (2266), 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-01-09 21:26:08,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:08,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 433 [2025-01-09 21:26:08,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:16,497 INFO L124 PetriNetUnfolderBase]: 312/10276 cut-off events. [2025-01-09 21:26:16,497 INFO L125 PetriNetUnfolderBase]: For 3804/3837 co-relation queries the response was YES. [2025-01-09 21:26:16,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15664 conditions, 10276 events. 312/10276 cut-off events. For 3804/3837 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 15752 event pairs, 61 based on Foata normal form. 8/10069 useless extension candidates. Maximal degree in co-relation 13453. Up to 2941 conditions per place. [2025-01-09 21:26:16,534 INFO L140 encePairwiseOnDemand]: 421/433 looper letters, 84 selfloop transitions, 31 changer transitions 0/757 dead transitions. [2025-01-09 21:26:16,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 757 transitions, 4604 flow [2025-01-09 21:26:16,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:16,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:16,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2311 transitions. [2025-01-09 21:26:16,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8895304080061586 [2025-01-09 21:26:16,540 INFO L175 Difference]: Start difference. First operand has 646 places, 718 transitions, 4254 flow. Second operand 6 states and 2311 transitions. [2025-01-09 21:26:16,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 757 transitions, 4604 flow [2025-01-09 21:26:16,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 609 places, 757 transitions, 4250 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-01-09 21:26:16,603 INFO L231 Difference]: Finished difference. Result has 614 places, 748 transitions, 4158 flow [2025-01-09 21:26:16,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=3900, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4158, PETRI_PLACES=614, PETRI_TRANSITIONS=748} [2025-01-09 21:26:16,604 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 187 predicate places. [2025-01-09 21:26:16,607 INFO L471 AbstractCegarLoop]: Abstraction has has 614 places, 748 transitions, 4158 flow [2025-01-09 21:26:16,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 377.6666666666667) internal successors, (2266), 6 states have internal predecessors, (2266), 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-01-09 21:26:16,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:16,609 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:16,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:26:16,609 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:26:16,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:16,637 INFO L85 PathProgramCache]: Analyzing trace with hash -859319950, now seen corresponding path program 1 times [2025-01-09 21:26:16,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:16,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801500092] [2025-01-09 21:26:16,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:16,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:17,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5610 statements into 1 equivalence classes. [2025-01-09 21:26:18,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5610 of 5610 statements. [2025-01-09 21:26:18,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:18,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 195751 backedges. 300 proven. 99091 refuted. 0 times theorem prover too weak. 96360 trivial. 0 not checked. [2025-01-09 21:26:31,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:31,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801500092] [2025-01-09 21:26:31,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801500092] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:26:31,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138076784] [2025-01-09 21:26:31,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:31,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:26:31,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:26:31,629 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:26:31,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 21:26:33,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5610 statements into 1 equivalence classes. [2025-01-09 21:26:36,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5610 of 5610 statements. [2025-01-09 21:26:36,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:36,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:36,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 22662 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 21:26:36,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:26:40,938 INFO L134 CoverageAnalysis]: Checked inductivity of 195751 backedges. 300 proven. 99091 refuted. 0 times theorem prover too weak. 96360 trivial. 0 not checked. [2025-01-09 21:26:40,939 INFO L312 TraceCheckSpWp]: Computing backward predicates...