./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 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/28-race_reach_91-arrayloop2_racefree.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 ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:29:01,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:29:01,562 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:29:01,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:29:01,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:29:01,593 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:29:01,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:29:01,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:29:01,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:29:01,594 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:29:01,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:29:01,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:29:01,594 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:29:01,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:29:01,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:29:01,594 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:29:01,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:29:01,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:29:01,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:29:01,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:29:01,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:29:01,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:29:01,595 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:29:01,595 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:29:01,595 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:29:01,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:29:01,595 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:29:01,595 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:29:01,595 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:29:01,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:01,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:01,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:01,595 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:29:01,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:01,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:01,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:01,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:29:01,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:29:01,595 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:29:01,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:29:01,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:29:01,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:29:01,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:29:01,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:29:01,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:29:01,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:29:01,596 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 -> ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3 [2025-01-09 21:29:01,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:29:01,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:29:01,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:29:01,866 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:29:01,867 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:29:01,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2025-01-09 21:29:03,044 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3b0cf575/7a778286598848928963c95d16c7a319/FLAGa28922cfe [2025-01-09 21:29:03,352 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:29:03,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2025-01-09 21:29:03,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3b0cf575/7a778286598848928963c95d16c7a319/FLAGa28922cfe [2025-01-09 21:29:03,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3b0cf575/7a778286598848928963c95d16c7a319 [2025-01-09 21:29:03,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:29:03,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:29:03,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:03,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:29:03,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:29:03,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:03" (1/1) ... [2025-01-09 21:29:03,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b98a044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:03, skipping insertion in model container [2025-01-09 21:29:03,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:03" (1/1) ... [2025-01-09 21:29:03,644 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:29:03,923 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:03,924 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:03,924 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:03,925 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:03,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:03,973 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:29:04,011 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:04,011 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:04,011 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:04,012 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:04,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:04,070 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:29:04,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:04 WrapperNode [2025-01-09 21:29:04,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:04,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:04,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:29:04,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:29:04,076 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:29:04" (1/1) ... [2025-01-09 21:29:04,087 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:29:04" (1/1) ... [2025-01-09 21:29:04,111 INFO L138 Inliner]: procedures = 279, calls = 120, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 360 [2025-01-09 21:29:04,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:04,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:29:04,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:29:04,112 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:29:04,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:04" (1/1) ... [2025-01-09 21:29:04,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:04" (1/1) ... [2025-01-09 21:29:04,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:04" (1/1) ... [2025-01-09 21:29:04,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:04" (1/1) ... [2025-01-09 21:29:04,143 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:04" (1/1) ... [2025-01-09 21:29:04,145 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:04" (1/1) ... [2025-01-09 21:29:04,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:04" (1/1) ... [2025-01-09 21:29:04,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:04" (1/1) ... [2025-01-09 21:29:04,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:04" (1/1) ... [2025-01-09 21:29:04,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:29:04,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:29:04,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:29:04,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:29:04,155 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:04" (1/1) ... [2025-01-09 21:29:04,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:04,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:04,188 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:29:04,191 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:29:04,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:29:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 21:29:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:29:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-09 21:29:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:29:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:29:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:29:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:29:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:29:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:29:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:29:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:29:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:29:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:29:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:29:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:29:04,212 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:29:04,330 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:29:04,331 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:29:04,847 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:29:04,848 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:29:04,878 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:29:04,878 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-01-09 21:29:04,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:04 BoogieIcfgContainer [2025-01-09 21:29:04,879 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:29:04,881 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:29:04,881 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:29:04,883 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:29:04,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:29:03" (1/3) ... [2025-01-09 21:29:04,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea5a0ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:04, skipping insertion in model container [2025-01-09 21:29:04,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:04" (2/3) ... [2025-01-09 21:29:04,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea5a0ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:04, skipping insertion in model container [2025-01-09 21:29:04,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:04" (3/3) ... [2025-01-09 21:29:04,888 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_91-arrayloop2_racefree.i [2025-01-09 21:29:04,897 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:29:04,898 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_91-arrayloop2_racefree.i that has 2 procedures, 383 locations, 1 initial locations, 11 loop locations, and 19 error locations. [2025-01-09 21:29:04,898 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:29:04,988 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:29:05,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 386 places, 402 transitions, 811 flow [2025-01-09 21:29:05,135 INFO L124 PetriNetUnfolderBase]: 19/432 cut-off events. [2025-01-09 21:29:05,138 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:29:05,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 432 events. 19/432 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 944 event pairs, 0 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 251. Up to 4 conditions per place. [2025-01-09 21:29:05,145 INFO L82 GeneralOperation]: Start removeDead. Operand has 386 places, 402 transitions, 811 flow [2025-01-09 21:29:05,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 386 places, 402 transitions, 811 flow [2025-01-09 21:29:05,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:29:05,173 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;@45db8fc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:29:05,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-01-09 21:29:05,194 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:29:05,194 INFO L124 PetriNetUnfolderBase]: 0/120 cut-off events. [2025-01-09 21:29:05,194 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:29:05,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:05,195 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:05,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:29:05,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:05,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1566684942, now seen corresponding path program 1 times [2025-01-09 21:29:05,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:05,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24900139] [2025-01-09 21:29:05,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:05,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:05,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 21:29:05,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 21:29:05,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:05,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:06,080 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:29:06,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:06,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24900139] [2025-01-09 21:29:06,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24900139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:06,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:06,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:06,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131019815] [2025-01-09 21:29:06,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:06,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:06,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:06,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:06,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:06,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 402 [2025-01-09 21:29:06,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 402 transitions, 811 flow. Second operand has 6 states, 6 states have (on average 297.3333333333333) internal successors, (1784), 6 states have internal predecessors, (1784), 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:29:06,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:06,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 402 [2025-01-09 21:29:06,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:06,760 INFO L124 PetriNetUnfolderBase]: 319/1602 cut-off events. [2025-01-09 21:29:06,760 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-01-09 21:29:06,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2292 conditions, 1602 events. 319/1602 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10016 event pairs, 288 based on Foata normal form. 86/1558 useless extension candidates. Maximal degree in co-relation 1972. Up to 674 conditions per place. [2025-01-09 21:29:06,774 INFO L140 encePairwiseOnDemand]: 377/402 looper letters, 80 selfloop transitions, 10 changer transitions 0/385 dead transitions. [2025-01-09 21:29:06,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 385 transitions, 957 flow [2025-01-09 21:29:06,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1881 transitions. [2025-01-09 21:29:06,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7798507462686567 [2025-01-09 21:29:06,794 INFO L175 Difference]: Start difference. First operand has 386 places, 402 transitions, 811 flow. Second operand 6 states and 1881 transitions. [2025-01-09 21:29:06,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 385 transitions, 957 flow [2025-01-09 21:29:06,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 385 transitions, 957 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:29:06,809 INFO L231 Difference]: Finished difference. Result has 387 places, 385 transitions, 797 flow [2025-01-09 21:29:06,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=797, PETRI_PLACES=387, PETRI_TRANSITIONS=385} [2025-01-09 21:29:06,817 INFO L279 CegarLoopForPetriNet]: 386 programPoint places, 1 predicate places. [2025-01-09 21:29:06,819 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 385 transitions, 797 flow [2025-01-09 21:29:06,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 297.3333333333333) internal successors, (1784), 6 states have internal predecessors, (1784), 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:29:06,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:06,820 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:06,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:29:06,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:29:06,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:06,821 INFO L85 PathProgramCache]: Analyzing trace with hash 808119297, now seen corresponding path program 1 times [2025-01-09 21:29:06,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:06,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629620599] [2025-01-09 21:29:06,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:06,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:06,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 21:29:06,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 21:29:06,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:06,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:06,916 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:29:06,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:06,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629620599] [2025-01-09 21:29:06,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629620599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:06,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:06,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:29:06,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261716406] [2025-01-09 21:29:06,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:06,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:06,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:06,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:06,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:06,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 402 [2025-01-09 21:29:06,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 385 transitions, 797 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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:29:06,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:06,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 402 [2025-01-09 21:29:06,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:07,022 INFO L124 PetriNetUnfolderBase]: 15/565 cut-off events. [2025-01-09 21:29:07,022 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-01-09 21:29:07,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 565 events. 15/565 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1666 event pairs, 8 based on Foata normal form. 1/522 useless extension candidates. Maximal degree in co-relation 402. Up to 34 conditions per place. [2025-01-09 21:29:07,025 INFO L140 encePairwiseOnDemand]: 399/402 looper letters, 15 selfloop transitions, 2 changer transitions 0/386 dead transitions. [2025-01-09 21:29:07,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 386 transitions, 833 flow [2025-01-09 21:29:07,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:07,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:07,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1134 transitions. [2025-01-09 21:29:07,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9402985074626866 [2025-01-09 21:29:07,029 INFO L175 Difference]: Start difference. First operand has 387 places, 385 transitions, 797 flow. Second operand 3 states and 1134 transitions. [2025-01-09 21:29:07,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 386 transitions, 833 flow [2025-01-09 21:29:07,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 386 transitions, 813 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:07,039 INFO L231 Difference]: Finished difference. Result has 385 places, 386 transitions, 789 flow [2025-01-09 21:29:07,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=789, PETRI_PLACES=385, PETRI_TRANSITIONS=386} [2025-01-09 21:29:07,040 INFO L279 CegarLoopForPetriNet]: 386 programPoint places, -1 predicate places. [2025-01-09 21:29:07,041 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 386 transitions, 789 flow [2025-01-09 21:29:07,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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:29:07,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:07,042 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:07,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:29:07,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:29:07,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:07,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1215732583, now seen corresponding path program 1 times [2025-01-09 21:29:07,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:07,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952839940] [2025-01-09 21:29:07,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:07,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:07,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:29:07,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:29:07,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:07,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:07,539 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:29:07,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:07,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952839940] [2025-01-09 21:29:07,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952839940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:07,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:07,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:07,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970396906] [2025-01-09 21:29:07,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:07,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:07,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:07,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:07,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:08,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 402 [2025-01-09 21:29:08,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 386 transitions, 789 flow. Second operand has 6 states, 6 states have (on average 297.3333333333333) internal successors, (1784), 6 states have internal predecessors, (1784), 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:29:08,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:08,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 402 [2025-01-09 21:29:08,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:08,503 INFO L124 PetriNetUnfolderBase]: 320/1724 cut-off events. [2025-01-09 21:29:08,504 INFO L125 PetriNetUnfolderBase]: For 8/16 co-relation queries the response was YES. [2025-01-09 21:29:08,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2465 conditions, 1724 events. 320/1724 cut-off events. For 8/16 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10806 event pairs, 288 based on Foata normal form. 0/1590 useless extension candidates. Maximal degree in co-relation 2201. Up to 708 conditions per place. [2025-01-09 21:29:08,510 INFO L140 encePairwiseOnDemand]: 390/402 looper letters, 80 selfloop transitions, 10 changer transitions 0/384 dead transitions. [2025-01-09 21:29:08,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 384 transitions, 965 flow [2025-01-09 21:29:08,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:08,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1868 transitions. [2025-01-09 21:29:08,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7744610281923715 [2025-01-09 21:29:08,517 INFO L175 Difference]: Start difference. First operand has 385 places, 386 transitions, 789 flow. Second operand 6 states and 1868 transitions. [2025-01-09 21:29:08,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 384 transitions, 965 flow [2025-01-09 21:29:08,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 384 transitions, 963 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:08,523 INFO L231 Difference]: Finished difference. Result has 387 places, 384 transitions, 803 flow [2025-01-09 21:29:08,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=803, PETRI_PLACES=387, PETRI_TRANSITIONS=384} [2025-01-09 21:29:08,525 INFO L279 CegarLoopForPetriNet]: 386 programPoint places, 1 predicate places. [2025-01-09 21:29:08,525 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 384 transitions, 803 flow [2025-01-09 21:29:08,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 297.3333333333333) internal successors, (1784), 6 states have internal predecessors, (1784), 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:29:08,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:08,526 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:08,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:29:08,526 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:29:08,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:08,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1157479812, now seen corresponding path program 1 times [2025-01-09 21:29:08,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:08,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168076846] [2025-01-09 21:29:08,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:08,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:08,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 21:29:08,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 21:29:08,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:08,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:08,933 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:29:08,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:08,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168076846] [2025-01-09 21:29:08,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168076846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:08,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:08,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:08,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435130718] [2025-01-09 21:29:08,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:08,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:08,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:08,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:08,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:09,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 402 [2025-01-09 21:29:09,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 384 transitions, 803 flow. Second operand has 6 states, 6 states have (on average 297.6666666666667) internal successors, (1786), 6 states have internal predecessors, (1786), 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:29:09,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:09,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 402 [2025-01-09 21:29:09,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:09,467 INFO L124 PetriNetUnfolderBase]: 320/1722 cut-off events. [2025-01-09 21:29:09,467 INFO L125 PetriNetUnfolderBase]: For 11/19 co-relation queries the response was YES. [2025-01-09 21:29:09,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2486 conditions, 1722 events. 320/1722 cut-off events. For 11/19 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10860 event pairs, 288 based on Foata normal form. 0/1590 useless extension candidates. Maximal degree in co-relation 2101. Up to 722 conditions per place. [2025-01-09 21:29:09,476 INFO L140 encePairwiseOnDemand]: 396/402 looper letters, 87 selfloop transitions, 5 changer transitions 0/383 dead transitions. [2025-01-09 21:29:09,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 383 transitions, 985 flow [2025-01-09 21:29:09,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:09,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:09,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1863 transitions. [2025-01-09 21:29:09,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7723880597014925 [2025-01-09 21:29:09,481 INFO L175 Difference]: Start difference. First operand has 387 places, 384 transitions, 803 flow. Second operand 6 states and 1863 transitions. [2025-01-09 21:29:09,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 383 transitions, 985 flow [2025-01-09 21:29:09,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 383 transitions, 965 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:09,488 INFO L231 Difference]: Finished difference. Result has 386 places, 383 transitions, 791 flow [2025-01-09 21:29:09,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=791, PETRI_PLACES=386, PETRI_TRANSITIONS=383} [2025-01-09 21:29:09,489 INFO L279 CegarLoopForPetriNet]: 386 programPoint places, 0 predicate places. [2025-01-09 21:29:09,490 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 383 transitions, 791 flow [2025-01-09 21:29:09,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 297.6666666666667) internal successors, (1786), 6 states have internal predecessors, (1786), 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:29:09,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:09,491 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:09,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:29:09,491 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:29:09,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:09,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1523820197, now seen corresponding path program 1 times [2025-01-09 21:29:09,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:09,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488051983] [2025-01-09 21:29:09,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:09,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:09,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 21:29:09,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 21:29:09,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:09,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:09,568 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:29:09,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:09,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488051983] [2025-01-09 21:29:09,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488051983] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:09,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:09,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:29:09,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724417680] [2025-01-09 21:29:09,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:09,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:09,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:09,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:09,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:09,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 402 [2025-01-09 21:29:09,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 383 transitions, 791 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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:29:09,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:09,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 402 [2025-01-09 21:29:09,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:09,669 INFO L124 PetriNetUnfolderBase]: 15/747 cut-off events. [2025-01-09 21:29:09,669 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-01-09 21:29:09,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 818 conditions, 747 events. 15/747 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1621 event pairs, 8 based on Foata normal form. 2/703 useless extension candidates. Maximal degree in co-relation 593. Up to 38 conditions per place. [2025-01-09 21:29:09,671 INFO L140 encePairwiseOnDemand]: 399/402 looper letters, 15 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2025-01-09 21:29:09,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 384 transitions, 827 flow [2025-01-09 21:29:09,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:09,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1134 transitions. [2025-01-09 21:29:09,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9402985074626866 [2025-01-09 21:29:09,675 INFO L175 Difference]: Start difference. First operand has 386 places, 383 transitions, 791 flow. Second operand 3 states and 1134 transitions. [2025-01-09 21:29:09,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 384 transitions, 827 flow [2025-01-09 21:29:09,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 384 transitions, 817 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:09,681 INFO L231 Difference]: Finished difference. Result has 384 places, 384 transitions, 793 flow [2025-01-09 21:29:09,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=384, PETRI_TRANSITIONS=384} [2025-01-09 21:29:09,683 INFO L279 CegarLoopForPetriNet]: 386 programPoint places, -2 predicate places. [2025-01-09 21:29:09,683 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 384 transitions, 793 flow [2025-01-09 21:29:09,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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:29:09,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:09,684 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:09,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:29:09,684 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:29:09,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:09,686 INFO L85 PathProgramCache]: Analyzing trace with hash -611223993, now seen corresponding path program 1 times [2025-01-09 21:29:09,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:09,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942882287] [2025-01-09 21:29:09,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:09,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:09,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 21:29:09,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 21:29:09,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:09,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:10,143 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:29:10,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:10,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942882287] [2025-01-09 21:29:10,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942882287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:10,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:10,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:10,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17836637] [2025-01-09 21:29:10,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:10,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:10,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:10,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:10,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:10,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 402 [2025-01-09 21:29:10,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 384 transitions, 793 flow. Second operand has 6 states, 6 states have (on average 324.5) internal successors, (1947), 6 states have internal predecessors, (1947), 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:29:10,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:10,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 402 [2025-01-09 21:29:10,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:10,645 INFO L124 PetriNetUnfolderBase]: 83/1061 cut-off events. [2025-01-09 21:29:10,645 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2025-01-09 21:29:10,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 1061 events. 83/1061 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3673 event pairs, 64 based on Foata normal form. 0/978 useless extension candidates. Maximal degree in co-relation 882. Up to 311 conditions per place. [2025-01-09 21:29:10,650 INFO L140 encePairwiseOnDemand]: 396/402 looper letters, 62 selfloop transitions, 5 changer transitions 0/383 dead transitions. [2025-01-09 21:29:10,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 383 transitions, 925 flow [2025-01-09 21:29:10,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1988 transitions. [2025-01-09 21:29:10,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.824212271973466 [2025-01-09 21:29:10,654 INFO L175 Difference]: Start difference. First operand has 384 places, 384 transitions, 793 flow. Second operand 6 states and 1988 transitions. [2025-01-09 21:29:10,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 383 transitions, 925 flow [2025-01-09 21:29:10,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 383 transitions, 923 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:10,661 INFO L231 Difference]: Finished difference. Result has 387 places, 383 transitions, 799 flow [2025-01-09 21:29:10,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=799, PETRI_PLACES=387, PETRI_TRANSITIONS=383} [2025-01-09 21:29:10,663 INFO L279 CegarLoopForPetriNet]: 386 programPoint places, 1 predicate places. [2025-01-09 21:29:10,663 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 383 transitions, 799 flow [2025-01-09 21:29:10,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 324.5) internal successors, (1947), 6 states have internal predecessors, (1947), 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:29:10,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:10,665 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:10,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:29:10,665 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:29:10,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:10,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1135580364, now seen corresponding path program 1 times [2025-01-09 21:29:10,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:10,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532294694] [2025-01-09 21:29:10,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:10,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:10,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 21:29:10,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 21:29:10,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:10,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:11,064 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:29:11,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:11,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532294694] [2025-01-09 21:29:11,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532294694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:11,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:11,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:11,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305525192] [2025-01-09 21:29:11,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:11,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:11,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:11,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:11,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:11,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 402 [2025-01-09 21:29:11,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 383 transitions, 799 flow. Second operand has 6 states, 6 states have (on average 300.3333333333333) internal successors, (1802), 6 states have internal predecessors, (1802), 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:29:11,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:11,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 402 [2025-01-09 21:29:11,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:11,583 INFO L124 PetriNetUnfolderBase]: 320/1902 cut-off events. [2025-01-09 21:29:11,583 INFO L125 PetriNetUnfolderBase]: For 11/19 co-relation queries the response was YES. [2025-01-09 21:29:11,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2751 conditions, 1902 events. 320/1902 cut-off events. For 11/19 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10789 event pairs, 288 based on Foata normal form. 0/1770 useless extension candidates. Maximal degree in co-relation 2245. Up to 788 conditions per place. [2025-01-09 21:29:11,589 INFO L140 encePairwiseOnDemand]: 396/402 looper letters, 87 selfloop transitions, 5 changer transitions 0/382 dead transitions. [2025-01-09 21:29:11,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 382 transitions, 981 flow [2025-01-09 21:29:11,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1863 transitions. [2025-01-09 21:29:11,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7723880597014925 [2025-01-09 21:29:11,594 INFO L175 Difference]: Start difference. First operand has 387 places, 383 transitions, 799 flow. Second operand 6 states and 1863 transitions. [2025-01-09 21:29:11,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 382 transitions, 981 flow [2025-01-09 21:29:11,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 382 transitions, 971 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:11,601 INFO L231 Difference]: Finished difference. Result has 386 places, 382 transitions, 797 flow [2025-01-09 21:29:11,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=797, PETRI_PLACES=386, PETRI_TRANSITIONS=382} [2025-01-09 21:29:11,602 INFO L279 CegarLoopForPetriNet]: 386 programPoint places, 0 predicate places. [2025-01-09 21:29:11,603 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 382 transitions, 797 flow [2025-01-09 21:29:11,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 300.3333333333333) internal successors, (1802), 6 states have internal predecessors, (1802), 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:29:11,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:11,604 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:11,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:29:11,605 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:29:11,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:11,605 INFO L85 PathProgramCache]: Analyzing trace with hash -476536408, now seen corresponding path program 1 times [2025-01-09 21:29:11,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:11,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279600263] [2025-01-09 21:29:11,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:11,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:11,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 21:29:11,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 21:29:11,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:11,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:11,964 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:29:11,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:11,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279600263] [2025-01-09 21:29:11,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279600263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:11,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:11,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:11,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292734461] [2025-01-09 21:29:11,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:11,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:11,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:11,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:11,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:12,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 402 [2025-01-09 21:29:12,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 382 transitions, 797 flow. Second operand has 6 states, 6 states have (on average 305.0) internal successors, (1830), 6 states have internal predecessors, (1830), 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:29:12,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:12,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 402 [2025-01-09 21:29:12,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:12,652 INFO L124 PetriNetUnfolderBase]: 320/1898 cut-off events. [2025-01-09 21:29:12,652 INFO L125 PetriNetUnfolderBase]: For 11/19 co-relation queries the response was YES. [2025-01-09 21:29:12,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2731 conditions, 1898 events. 320/1898 cut-off events. For 11/19 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10740 event pairs, 288 based on Foata normal form. 0/1770 useless extension candidates. Maximal degree in co-relation 2261. Up to 772 conditions per place. [2025-01-09 21:29:12,658 INFO L140 encePairwiseOnDemand]: 396/402 looper letters, 83 selfloop transitions, 5 changer transitions 0/381 dead transitions. [2025-01-09 21:29:12,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 381 transitions, 971 flow [2025-01-09 21:29:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2025-01-09 21:29:12,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7806799336650083 [2025-01-09 21:29:12,662 INFO L175 Difference]: Start difference. First operand has 386 places, 382 transitions, 797 flow. Second operand 6 states and 1883 transitions. [2025-01-09 21:29:12,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 381 transitions, 971 flow [2025-01-09 21:29:12,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 381 transitions, 961 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:12,667 INFO L231 Difference]: Finished difference. Result has 385 places, 381 transitions, 795 flow [2025-01-09 21:29:12,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=795, PETRI_PLACES=385, PETRI_TRANSITIONS=381} [2025-01-09 21:29:12,669 INFO L279 CegarLoopForPetriNet]: 386 programPoint places, -1 predicate places. [2025-01-09 21:29:12,670 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 381 transitions, 795 flow [2025-01-09 21:29:12,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 305.0) internal successors, (1830), 6 states have internal predecessors, (1830), 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:29:12,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:12,671 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:12,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:29:12,671 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:29:12,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:12,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1670934289, now seen corresponding path program 1 times [2025-01-09 21:29:12,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:12,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257985577] [2025-01-09 21:29:12,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:12,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:12,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-09 21:29:12,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-09 21:29:12,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:12,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:13,089 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:29:13,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:13,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257985577] [2025-01-09 21:29:13,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257985577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:13,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:13,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:13,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023213418] [2025-01-09 21:29:13,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:13,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:13,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:13,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:13,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:13,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 402 [2025-01-09 21:29:13,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 381 transitions, 795 flow. Second operand has 6 states, 6 states have (on average 305.0) internal successors, (1830), 6 states have internal predecessors, (1830), 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:29:13,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:13,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 402 [2025-01-09 21:29:13,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:13,520 INFO L124 PetriNetUnfolderBase]: 320/1894 cut-off events. [2025-01-09 21:29:13,520 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2025-01-09 21:29:13,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2727 conditions, 1894 events. 320/1894 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10725 event pairs, 288 based on Foata normal form. 0/1770 useless extension candidates. Maximal degree in co-relation 2276. Up to 772 conditions per place. [2025-01-09 21:29:13,529 INFO L140 encePairwiseOnDemand]: 396/402 looper letters, 83 selfloop transitions, 5 changer transitions 0/380 dead transitions. [2025-01-09 21:29:13,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 380 transitions, 969 flow [2025-01-09 21:29:13,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:13,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2025-01-09 21:29:13,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7806799336650083 [2025-01-09 21:29:13,533 INFO L175 Difference]: Start difference. First operand has 385 places, 381 transitions, 795 flow. Second operand 6 states and 1883 transitions. [2025-01-09 21:29:13,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 380 transitions, 969 flow [2025-01-09 21:29:13,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 380 transitions, 959 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:13,539 INFO L231 Difference]: Finished difference. Result has 384 places, 380 transitions, 793 flow [2025-01-09 21:29:13,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=793, PETRI_PLACES=384, PETRI_TRANSITIONS=380} [2025-01-09 21:29:13,541 INFO L279 CegarLoopForPetriNet]: 386 programPoint places, -2 predicate places. [2025-01-09 21:29:13,541 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 380 transitions, 793 flow [2025-01-09 21:29:13,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 305.0) internal successors, (1830), 6 states have internal predecessors, (1830), 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:29:13,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:13,543 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:13,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:29:13,543 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:29:13,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:13,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1877418639, now seen corresponding path program 1 times [2025-01-09 21:29:13,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:13,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589457199] [2025-01-09 21:29:13,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:13,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:13,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 21:29:13,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 21:29:13,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:13,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:13,916 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:29:13,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:13,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589457199] [2025-01-09 21:29:13,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589457199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:13,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:13,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:13,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522353957] [2025-01-09 21:29:13,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:13,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:13,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:13,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:13,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:14,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 402 [2025-01-09 21:29:14,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 380 transitions, 793 flow. Second operand has 6 states, 6 states have (on average 301.5) internal successors, (1809), 6 states have internal predecessors, (1809), 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:29:14,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:14,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 402 [2025-01-09 21:29:14,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:14,452 INFO L124 PetriNetUnfolderBase]: 320/1890 cut-off events. [2025-01-09 21:29:14,452 INFO L125 PetriNetUnfolderBase]: For 11/19 co-relation queries the response was YES. [2025-01-09 21:29:14,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2743 conditions, 1890 events. 320/1890 cut-off events. For 11/19 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10691 event pairs, 288 based on Foata normal form. 0/1770 useless extension candidates. Maximal degree in co-relation 2289. Up to 792 conditions per place. [2025-01-09 21:29:14,461 INFO L140 encePairwiseOnDemand]: 396/402 looper letters, 88 selfloop transitions, 5 changer transitions 0/379 dead transitions. [2025-01-09 21:29:14,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 379 transitions, 977 flow [2025-01-09 21:29:14,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:14,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1858 transitions. [2025-01-09 21:29:14,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7703150912106136 [2025-01-09 21:29:14,466 INFO L175 Difference]: Start difference. First operand has 384 places, 380 transitions, 793 flow. Second operand 6 states and 1858 transitions. [2025-01-09 21:29:14,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 379 transitions, 977 flow [2025-01-09 21:29:14,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 379 transitions, 967 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:14,474 INFO L231 Difference]: Finished difference. Result has 383 places, 379 transitions, 791 flow [2025-01-09 21:29:14,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=791, PETRI_PLACES=383, PETRI_TRANSITIONS=379} [2025-01-09 21:29:14,476 INFO L279 CegarLoopForPetriNet]: 386 programPoint places, -3 predicate places. [2025-01-09 21:29:14,476 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 379 transitions, 791 flow [2025-01-09 21:29:14,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 301.5) internal successors, (1809), 6 states have internal predecessors, (1809), 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:29:14,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:14,478 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:14,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:29:14,478 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:29:14,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:14,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2111832710, now seen corresponding path program 1 times [2025-01-09 21:29:14,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:14,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715990866] [2025-01-09 21:29:14,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:14,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:14,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 21:29:14,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 21:29:14,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:14,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:14,654 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:29:14,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:14,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715990866] [2025-01-09 21:29:14,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715990866] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:29:14,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133206221] [2025-01-09 21:29:14,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:14,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:29:14,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:14,658 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:29:14,660 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:29:14,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 21:29:14,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 21:29:14,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:14,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:14,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 21:29:14,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:29:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 21:29:14,884 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:29:14,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133206221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:14,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:29:14,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 21:29:14,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243598609] [2025-01-09 21:29:14,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:14,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:14,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:14,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:14,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:14,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 402 [2025-01-09 21:29:14,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 379 transitions, 791 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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:29:14,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:14,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 402 [2025-01-09 21:29:14,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:15,004 INFO L124 PetriNetUnfolderBase]: 38/996 cut-off events. [2025-01-09 21:29:15,005 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2025-01-09 21:29:15,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1118 conditions, 996 events. 38/996 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3613 event pairs, 0 based on Foata normal form. 2/936 useless extension candidates. Maximal degree in co-relation 773. Up to 72 conditions per place. [2025-01-09 21:29:15,007 INFO L140 encePairwiseOnDemand]: 399/402 looper letters, 22 selfloop transitions, 2 changer transitions 0/387 dead transitions. [2025-01-09 21:29:15,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 387 transitions, 855 flow [2025-01-09 21:29:15,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:15,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1141 transitions. [2025-01-09 21:29:15,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9461028192371476 [2025-01-09 21:29:15,009 INFO L175 Difference]: Start difference. First operand has 383 places, 379 transitions, 791 flow. Second operand 3 states and 1141 transitions. [2025-01-09 21:29:15,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 387 transitions, 855 flow [2025-01-09 21:29:15,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 387 transitions, 845 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:15,014 INFO L231 Difference]: Finished difference. Result has 381 places, 379 transitions, 789 flow [2025-01-09 21:29:15,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=789, PETRI_PLACES=381, PETRI_TRANSITIONS=379} [2025-01-09 21:29:15,015 INFO L279 CegarLoopForPetriNet]: 386 programPoint places, -5 predicate places. [2025-01-09 21:29:15,015 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 379 transitions, 789 flow [2025-01-09 21:29:15,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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:29:15,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:15,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:15,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 21:29:15,216 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:29:15,216 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:29:15,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:15,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1226891137, now seen corresponding path program 1 times [2025-01-09 21:29:15,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:15,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65394667] [2025-01-09 21:29:15,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:15,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:15,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 21:29:15,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 21:29:15,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:15,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:15,357 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:29:15,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:15,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65394667] [2025-01-09 21:29:15,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65394667] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:29:15,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944405086] [2025-01-09 21:29:15,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:15,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:29:15,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:15,360 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:29:15,366 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:29:15,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 21:29:15,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 21:29:15,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:15,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:15,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:29:15,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:29:15,720 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:29:15,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:29:15,846 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:29:15,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944405086] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:29:15,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:29:15,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:29:15,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39482205] [2025-01-09 21:29:15,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:29:15,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:29:15,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:15,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:29:15,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:29:15,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 402 [2025-01-09 21:29:15,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 379 transitions, 789 flow. Second operand has 10 states, 10 states have (on average 370.8) internal successors, (3708), 10 states have internal predecessors, (3708), 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:29:15,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:15,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 402 [2025-01-09 21:29:15,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:16,027 INFO L124 PetriNetUnfolderBase]: 14/908 cut-off events. [2025-01-09 21:29:16,028 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-01-09 21:29:16,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 908 events. 14/908 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1087 event pairs, 8 based on Foata normal form. 4/888 useless extension candidates. Maximal degree in co-relation 750. Up to 38 conditions per place. [2025-01-09 21:29:16,030 INFO L140 encePairwiseOnDemand]: 396/402 looper letters, 19 selfloop transitions, 9 changer transitions 0/387 dead transitions. [2025-01-09 21:29:16,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 387 transitions, 863 flow [2025-01-09 21:29:16,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:29:16,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:29:16,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3351 transitions. [2025-01-09 21:29:16,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9262023217247097 [2025-01-09 21:29:16,036 INFO L175 Difference]: Start difference. First operand has 381 places, 379 transitions, 789 flow. Second operand 9 states and 3351 transitions. [2025-01-09 21:29:16,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 387 transitions, 863 flow [2025-01-09 21:29:16,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 387 transitions, 859 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:16,040 INFO L231 Difference]: Finished difference. Result has 390 places, 385 transitions, 835 flow [2025-01-09 21:29:16,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=835, PETRI_PLACES=390, PETRI_TRANSITIONS=385} [2025-01-09 21:29:16,041 INFO L279 CegarLoopForPetriNet]: 386 programPoint places, 4 predicate places. [2025-01-09 21:29:16,041 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 385 transitions, 835 flow [2025-01-09 21:29:16,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 370.8) internal successors, (3708), 10 states have internal predecessors, (3708), 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:29:16,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:16,043 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:16,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 21:29:16,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:29:16,244 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:29:16,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:16,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1076738689, now seen corresponding path program 2 times [2025-01-09 21:29:16,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:16,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255423450] [2025-01-09 21:29:16,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:29:16,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:16,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 401 statements into 2 equivalence classes. [2025-01-09 21:29:16,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 401 statements. [2025-01-09 21:29:16,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:29:16,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2025-01-09 21:29:16,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:16,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255423450] [2025-01-09 21:29:16,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255423450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:16,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:16,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:16,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920728620] [2025-01-09 21:29:16,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:16,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:16,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:16,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:16,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:16,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 402 [2025-01-09 21:29:16,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 385 transitions, 835 flow. Second operand has 6 states, 6 states have (on average 300.1666666666667) internal successors, (1801), 6 states have internal predecessors, (1801), 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:29:16,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:16,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 402 [2025-01-09 21:29:16,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:17,485 INFO L124 PetriNetUnfolderBase]: 738/3471 cut-off events. [2025-01-09 21:29:17,485 INFO L125 PetriNetUnfolderBase]: For 16/30 co-relation queries the response was YES. [2025-01-09 21:29:17,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5278 conditions, 3471 events. 738/3471 cut-off events. For 16/30 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 22608 event pairs, 315 based on Foata normal form. 4/3231 useless extension candidates. Maximal degree in co-relation 4613. Up to 1428 conditions per place. [2025-01-09 21:29:17,500 INFO L140 encePairwiseOnDemand]: 367/402 looper letters, 127 selfloop transitions, 118 changer transitions 0/534 dead transitions. [2025-01-09 21:29:17,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 534 transitions, 1624 flow [2025-01-09 21:29:17,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:17,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:17,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1998 transitions. [2025-01-09 21:29:17,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8283582089552238 [2025-01-09 21:29:17,505 INFO L175 Difference]: Start difference. First operand has 390 places, 385 transitions, 835 flow. Second operand 6 states and 1998 transitions. [2025-01-09 21:29:17,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 534 transitions, 1624 flow [2025-01-09 21:29:17,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 534 transitions, 1618 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:17,514 INFO L231 Difference]: Finished difference. Result has 399 places, 502 transitions, 1604 flow [2025-01-09 21:29:17,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1604, PETRI_PLACES=399, PETRI_TRANSITIONS=502} [2025-01-09 21:29:17,515 INFO L279 CegarLoopForPetriNet]: 386 programPoint places, 13 predicate places. [2025-01-09 21:29:17,515 INFO L471 AbstractCegarLoop]: Abstraction has has 399 places, 502 transitions, 1604 flow [2025-01-09 21:29:17,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 300.1666666666667) internal successors, (1801), 6 states have internal predecessors, (1801), 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:29:17,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:17,516 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:17,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:29:17,516 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:29:17,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:17,517 INFO L85 PathProgramCache]: Analyzing trace with hash -359055403, now seen corresponding path program 1 times [2025-01-09 21:29:17,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:17,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080261324] [2025-01-09 21:29:17,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:17,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:17,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-01-09 21:29:17,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-01-09 21:29:17,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:17,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:17,786 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2025-01-09 21:29:17,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:17,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080261324] [2025-01-09 21:29:17,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080261324] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:29:17,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990038320] [2025-01-09 21:29:17,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:17,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:29:17,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:17,792 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:29:17,796 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:29:17,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-01-09 21:29:18,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-01-09 21:29:18,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:18,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:18,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 1525 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:29:18,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:29:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 1 proven. 363 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 21:29:18,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:29:18,758 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 1 proven. 363 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 21:29:18,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990038320] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:29:18,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:29:18,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-01-09 21:29:18,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344462227] [2025-01-09 21:29:18,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:29:18,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 21:29:18,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:18,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 21:29:18,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-01-09 21:29:18,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 402 [2025-01-09 21:29:18,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 502 transitions, 1604 flow. Second operand has 19 states, 19 states have (on average 365.57894736842104) internal successors, (6946), 19 states have internal predecessors, (6946), 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:29:18,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:18,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 402 [2025-01-09 21:29:18,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:20,101 INFO L124 PetriNetUnfolderBase]: 289/3397 cut-off events. [2025-01-09 21:29:20,102 INFO L125 PetriNetUnfolderBase]: For 263/311 co-relation queries the response was YES. [2025-01-09 21:29:20,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4652 conditions, 3397 events. 289/3397 cut-off events. For 263/311 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 9414 event pairs, 8 based on Foata normal form. 13/3314 useless extension candidates. Maximal degree in co-relation 2554. Up to 345 conditions per place. [2025-01-09 21:29:20,111 INFO L140 encePairwiseOnDemand]: 391/402 looper letters, 51 selfloop transitions, 68 changer transitions 0/588 dead transitions. [2025-01-09 21:29:20,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 588 transitions, 2252 flow [2025-01-09 21:29:20,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-01-09 21:29:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-01-09 21:29:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 23001 transitions. [2025-01-09 21:29:20,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.908197109689647 [2025-01-09 21:29:20,177 INFO L175 Difference]: Start difference. First operand has 399 places, 502 transitions, 1604 flow. Second operand 63 states and 23001 transitions. [2025-01-09 21:29:20,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 588 transitions, 2252 flow [2025-01-09 21:29:20,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 461 places, 588 transitions, 2252 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:29:20,186 INFO L231 Difference]: Finished difference. Result has 477 places, 564 transitions, 2124 flow [2025-01-09 21:29:20,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=2124, PETRI_PLACES=477, PETRI_TRANSITIONS=564} [2025-01-09 21:29:20,187 INFO L279 CegarLoopForPetriNet]: 386 programPoint places, 91 predicate places. [2025-01-09 21:29:20,187 INFO L471 AbstractCegarLoop]: Abstraction has has 477 places, 564 transitions, 2124 flow [2025-01-09 21:29:20,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 365.57894736842104) internal successors, (6946), 19 states have internal predecessors, (6946), 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:29:20,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:20,190 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:20,198 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:29:20,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:29:20,390 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:29:20,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:20,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1060448702, now seen corresponding path program 2 times [2025-01-09 21:29:20,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:20,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629542438] [2025-01-09 21:29:20,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:29:20,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:20,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1434 statements into 2 equivalence classes. [2025-01-09 21:29:20,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 116 of 1434 statements. [2025-01-09 21:29:20,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:29:20,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11189 trivial. 0 not checked. [2025-01-09 21:29:20,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:20,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629542438] [2025-01-09 21:29:20,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629542438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:20,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:20,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:20,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645742174] [2025-01-09 21:29:20,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:20,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:29:20,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:20,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:29:20,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:29:20,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 402 [2025-01-09 21:29:20,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 564 transitions, 2124 flow. Second operand has 5 states, 5 states have (on average 371.6) internal successors, (1858), 5 states have internal predecessors, (1858), 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:29:20,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:20,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 402 [2025-01-09 21:29:20,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:21,549 INFO L124 PetriNetUnfolderBase]: 302/3578 cut-off events. [2025-01-09 21:29:21,549 INFO L125 PetriNetUnfolderBase]: For 631/672 co-relation queries the response was YES. [2025-01-09 21:29:21,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5003 conditions, 3578 events. 302/3578 cut-off events. For 631/672 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10918 event pairs, 0 based on Foata normal form. 9/3481 useless extension candidates. Maximal degree in co-relation 3352. Up to 397 conditions per place. [2025-01-09 21:29:21,563 INFO L140 encePairwiseOnDemand]: 397/402 looper letters, 34 selfloop transitions, 5 changer transitions 0/565 dead transitions. [2025-01-09 21:29:21,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 565 transitions, 2199 flow [2025-01-09 21:29:21,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2259 transitions. [2025-01-09 21:29:21,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9365671641791045 [2025-01-09 21:29:21,565 INFO L175 Difference]: Start difference. First operand has 477 places, 564 transitions, 2124 flow. Second operand 6 states and 2259 transitions. [2025-01-09 21:29:21,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 565 transitions, 2199 flow [2025-01-09 21:29:21,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 565 transitions, 2120 flow, removed 19 selfloop flow, removed 8 redundant places. [2025-01-09 21:29:21,582 INFO L231 Difference]: Finished difference. Result has 452 places, 541 transitions, 2004 flow [2025-01-09 21:29:21,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=1994, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2004, PETRI_PLACES=452, PETRI_TRANSITIONS=541} [2025-01-09 21:29:21,583 INFO L279 CegarLoopForPetriNet]: 386 programPoint places, 66 predicate places. [2025-01-09 21:29:21,583 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 541 transitions, 2004 flow [2025-01-09 21:29:21,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 371.6) internal successors, (1858), 5 states have internal predecessors, (1858), 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:29:21,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:21,585 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:21,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:29:21,585 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:29:21,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:21,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1064603357, now seen corresponding path program 1 times [2025-01-09 21:29:21,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:21,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932636821] [2025-01-09 21:29:21,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:21,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:21,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1435 statements into 1 equivalence classes. [2025-01-09 21:29:21,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1435 of 1435 statements. [2025-01-09 21:29:21,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:21,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 5920 proven. 2527 refuted. 0 times theorem prover too weak. 2742 trivial. 0 not checked. [2025-01-09 21:29:24,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:24,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932636821] [2025-01-09 21:29:24,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932636821] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:29:24,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928452712] [2025-01-09 21:29:24,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:24,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:29:24,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:24,043 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:29:24,045 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:29:24,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1435 statements into 1 equivalence classes. [2025-01-09 21:29:25,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1435 of 1435 statements. [2025-01-09 21:29:25,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:25,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:25,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 5693 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 21:29:25,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:29:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 5920 proven. 2527 refuted. 0 times theorem prover too weak. 2742 trivial. 0 not checked. [2025-01-09 21:29:25,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:29:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 5920 proven. 2527 refuted. 0 times theorem prover too weak. 2742 trivial. 0 not checked. [2025-01-09 21:29:26,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928452712] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:29:26,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:29:26,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-01-09 21:29:26,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263167316] [2025-01-09 21:29:26,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:29:26,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 21:29:26,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:26,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 21:29:26,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 21:29:26,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 402 [2025-01-09 21:29:26,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 541 transitions, 2004 flow. Second operand has 34 states, 34 states have (on average 371.1470588235294) internal successors, (12619), 34 states have internal predecessors, (12619), 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:29:26,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:26,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 402 [2025-01-09 21:29:26,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:28,531 INFO L124 PetriNetUnfolderBase]: 278/5491 cut-off events. [2025-01-09 21:29:28,531 INFO L125 PetriNetUnfolderBase]: For 3390/3437 co-relation queries the response was YES. [2025-01-09 21:29:28,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7224 conditions, 5491 events. 278/5491 cut-off events. For 3390/3437 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 8671 event pairs, 0 based on Foata normal form. 24/5430 useless extension candidates. Maximal degree in co-relation 4986. Up to 345 conditions per place. [2025-01-09 21:29:28,543 INFO L140 encePairwiseOnDemand]: 396/402 looper letters, 49 selfloop transitions, 135 changer transitions 0/642 dead transitions. [2025-01-09 21:29:28,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 642 transitions, 3136 flow [2025-01-09 21:29:28,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-01-09 21:29:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-01-09 21:29:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 16687 transitions. [2025-01-09 21:29:28,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9224433388612493 [2025-01-09 21:29:28,551 INFO L175 Difference]: Start difference. First operand has 452 places, 541 transitions, 2004 flow. Second operand 45 states and 16687 transitions. [2025-01-09 21:29:28,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 642 transitions, 3136 flow [2025-01-09 21:29:28,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 642 transitions, 3127 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:29:28,565 INFO L231 Difference]: Finished difference. Result has 501 places, 616 transitions, 2869 flow [2025-01-09 21:29:28,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=1995, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2869, PETRI_PLACES=501, PETRI_TRANSITIONS=616} [2025-01-09 21:29:28,567 INFO L279 CegarLoopForPetriNet]: 386 programPoint places, 115 predicate places. [2025-01-09 21:29:28,567 INFO L471 AbstractCegarLoop]: Abstraction has has 501 places, 616 transitions, 2869 flow [2025-01-09 21:29:28,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 371.1470588235294) internal successors, (12619), 34 states have internal predecessors, (12619), 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:29:28,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:28,571 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:28,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 21:29:28,771 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,SelfDestructingSolverStorable15 [2025-01-09 21:29:28,772 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:29:28,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:28,777 INFO L85 PathProgramCache]: Analyzing trace with hash 565069347, now seen corresponding path program 2 times [2025-01-09 21:29:28,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:28,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965119807] [2025-01-09 21:29:28,778 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:29:28,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:29,079 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2875 statements into 2 equivalence classes. [2025-01-09 21:29:29,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 2875 of 2875 statements. [2025-01-09 21:29:29,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:29:29,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:38,864 INFO L134 CoverageAnalysis]: Checked inductivity of 52741 backedges. 27056 proven. 12615 refuted. 0 times theorem prover too weak. 13070 trivial. 0 not checked. [2025-01-09 21:29:38,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:38,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965119807] [2025-01-09 21:29:38,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965119807] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:29:38,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101794163] [2025-01-09 21:29:38,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:29:38,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:29:38,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:38,869 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:29:38,871 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:29:39,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2875 statements into 2 equivalence classes. [2025-01-09 21:29:40,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 2875 of 2875 statements. [2025-01-09 21:29:40,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:29:40,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:40,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 11581 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 21:29:40,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:29:41,751 INFO L134 CoverageAnalysis]: Checked inductivity of 52741 backedges. 27056 proven. 12615 refuted. 0 times theorem prover too weak. 13070 trivial. 0 not checked. [2025-01-09 21:29:41,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:29:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 52741 backedges. 27056 proven. 12615 refuted. 0 times theorem prover too weak. 13070 trivial. 0 not checked. [2025-01-09 21:29:43,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101794163] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:29:43,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:29:43,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-01-09 21:29:43,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524490824] [2025-01-09 21:29:43,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:29:43,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-01-09 21:29:43,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:43,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-01-09 21:29:43,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-01-09 21:29:43,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 402 [2025-01-09 21:29:43,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 616 transitions, 2869 flow. Second operand has 63 states, 63 states have (on average 371.1111111111111) internal successors, (23380), 63 states have internal predecessors, (23380), 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:29:43,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:43,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 402 [2025-01-09 21:29:43,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:50,526 INFO L124 PetriNetUnfolderBase]: 278/9541 cut-off events. [2025-01-09 21:29:50,526 INFO L125 PetriNetUnfolderBase]: For 13598/13645 co-relation queries the response was YES. [2025-01-09 21:29:50,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12442 conditions, 9541 events. 278/9541 cut-off events. For 13598/13645 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 8672 event pairs, 0 based on Foata normal form. 45/9501 useless extension candidates. Maximal degree in co-relation 10199. Up to 345 conditions per place. [2025-01-09 21:29:50,551 INFO L140 encePairwiseOnDemand]: 396/402 looper letters, 94 selfloop transitions, 270 changer transitions 0/822 dead transitions. [2025-01-09 21:29:50,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 822 transitions, 5783 flow [2025-01-09 21:29:50,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-01-09 21:29:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-01-09 21:29:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 33359 transitions. [2025-01-09 21:29:50,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9220287451630735 [2025-01-09 21:29:50,567 INFO L175 Difference]: Start difference. First operand has 501 places, 616 transitions, 2869 flow. Second operand 90 states and 33359 transitions. [2025-01-09 21:29:50,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 822 transitions, 5783 flow [2025-01-09 21:29:50,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 822 transitions, 5675 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-01-09 21:29:50,597 INFO L231 Difference]: Finished difference. Result has 588 places, 754 transitions, 4753 flow [2025-01-09 21:29:50,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=2761, PETRI_DIFFERENCE_MINUEND_PLACES=483, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4753, PETRI_PLACES=588, PETRI_TRANSITIONS=754} [2025-01-09 21:29:50,598 INFO L279 CegarLoopForPetriNet]: 386 programPoint places, 202 predicate places. [2025-01-09 21:29:50,598 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 754 transitions, 4753 flow [2025-01-09 21:29:50,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 371.1111111111111) internal successors, (23380), 63 states have internal predecessors, (23380), 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:29:50,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:50,607 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:50,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 21:29:50,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 21:29:50,808 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:29:50,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:50,818 INFO L85 PathProgramCache]: Analyzing trace with hash -2004492605, now seen corresponding path program 3 times [2025-01-09 21:29:50,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:50,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296725111] [2025-01-09 21:29:50,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:29:50,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:51,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5575 statements into 37 equivalence classes. [2025-01-09 21:29:51,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 196 of 5575 statements. [2025-01-09 21:29:51,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 21:29:51,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 213451 backedges. 0 proven. 108091 refuted. 0 times theorem prover too weak. 105360 trivial. 0 not checked. [2025-01-09 21:29:51,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:51,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296725111] [2025-01-09 21:29:51,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296725111] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:29:51,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614468660] [2025-01-09 21:29:51,472 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:29:51,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:29:51,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:51,475 INFO L229 MonitoredProcess]: Starting monitored process 7 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:29:51,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 21:29:53,390 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5575 statements into 37 equivalence classes. [2025-01-09 21:29:53,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 196 of 5575 statements. [2025-01-09 21:29:53,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 21:29:53,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:53,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 21:29:53,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:29:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 213451 backedges. 0 proven. 108091 refuted. 0 times theorem prover too weak. 105360 trivial. 0 not checked. [2025-01-09 21:29:57,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:30:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 213451 backedges. 0 proven. 108091 refuted. 0 times theorem prover too weak. 105360 trivial. 0 not checked. [2025-01-09 21:30:01,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614468660] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:30:01,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:30:01,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-01-09 21:30:01,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752281664] [2025-01-09 21:30:01,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:30:01,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 21:30:01,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:01,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 21:30:01,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-01-09 21:30:02,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 402 [2025-01-09 21:30:02,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 754 transitions, 4753 flow. Second operand has 14 states, 14 states have (on average 370.92857142857144) internal successors, (5193), 14 states have internal predecessors, (5193), 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:30:02,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:02,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 402 [2025-01-09 21:30:02,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:19,126 INFO L124 PetriNetUnfolderBase]: 280/15003 cut-off events. [2025-01-09 21:30:19,126 INFO L125 PetriNetUnfolderBase]: For 6083/6130 co-relation queries the response was YES. [2025-01-09 21:30:19,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19192 conditions, 15003 events. 280/15003 cut-off events. For 6083/6130 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 7947 event pairs, 0 based on Foata normal form. 3/14921 useless extension candidates. Maximal degree in co-relation 16933. Up to 345 conditions per place. [2025-01-09 21:30:19,158 INFO L140 encePairwiseOnDemand]: 396/402 looper letters, 19 selfloop transitions, 15 changer transitions 0/767 dead transitions. [2025-01-09 21:30:19,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 767 transitions, 4867 flow [2025-01-09 21:30:19,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 21:30:19,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 21:30:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 5572 transitions. [2025-01-09 21:30:19,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9240464344941957 [2025-01-09 21:30:19,161 INFO L175 Difference]: Start difference. First operand has 588 places, 754 transitions, 4753 flow. Second operand 15 states and 5572 transitions. [2025-01-09 21:30:19,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 767 transitions, 4867 flow [2025-01-09 21:30:19,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 767 transitions, 4513 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-01-09 21:30:19,201 INFO L231 Difference]: Finished difference. Result has 564 places, 763 transitions, 4489 flow [2025-01-09 21:30:19,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=4399, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=754, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=745, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4489, PETRI_PLACES=564, PETRI_TRANSITIONS=763} [2025-01-09 21:30:19,202 INFO L279 CegarLoopForPetriNet]: 386 programPoint places, 178 predicate places. [2025-01-09 21:30:19,202 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 763 transitions, 4489 flow [2025-01-09 21:30:19,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 370.92857142857144) internal successors, (5193), 14 states have internal predecessors, (5193), 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:30:19,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:19,206 INFO L206 CegarLoopForPetriNet]: trace histogram [150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:19,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 21:30:19,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 21:30:19,407 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:30:19,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:19,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1132996857, now seen corresponding path program 4 times [2025-01-09 21:30:19,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:19,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955511183] [2025-01-09 21:30:19,441 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:30:19,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:20,673 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 13762 statements into 2 equivalence classes. [2025-01-09 21:30:22,606 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13376 of 13762 statements. [2025-01-09 21:30:22,607 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 21:30:22,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat