./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 c00e63dc 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-?-c00e63d-m [2025-02-06 09:27:18,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:27:18,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:27:18,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:27:18,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:27:18,575 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:27:18,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:27:18,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:27:18,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:27:18,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:27:18,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:27:18,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:27:18,577 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:27:18,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:27:18,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:27:18,577 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:27:18,577 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:27:18,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:27:18,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:27:18,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:27:18,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:27:18,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:27:18,577 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:27:18,577 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:27:18,577 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:27:18,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:27:18,577 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:27:18,577 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:27:18,577 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:27:18,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:27:18,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:27:18,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:27:18,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:27:18,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:27:18,578 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:27:18,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:27:18,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:27:18,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:27:18,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:27:18,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:27:18,582 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:27:18,582 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:27:18,582 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-02-06 09:27:18,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:27:18,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:27:18,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:27:18,813 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:27:18,813 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:27:18,814 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-02-06 09:27:20,074 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8cd3d6ec2/2c4350c7cf484cfbaefe35a5e999504e/FLAG1df84790f [2025-02-06 09:27:20,435 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:27:20,438 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2025-02-06 09:27:20,460 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8cd3d6ec2/2c4350c7cf484cfbaefe35a5e999504e/FLAG1df84790f [2025-02-06 09:27:20,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8cd3d6ec2/2c4350c7cf484cfbaefe35a5e999504e [2025-02-06 09:27:20,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:27:20,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:27:20,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:27:20,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:27:20,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:27:20,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:27:20" (1/1) ... [2025-02-06 09:27:20,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67682a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:20, skipping insertion in model container [2025-02-06 09:27:20,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:27:20" (1/1) ... [2025-02-06 09:27:20,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:27:20,990 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:20,991 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:20,992 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:20,992 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:21,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:27:21,030 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:27:21,077 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:21,078 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:21,078 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:21,078 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:21,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:27:21,146 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:27:21,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21 WrapperNode [2025-02-06 09:27:21,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:27:21,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:27:21,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:27:21,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:27:21,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,166 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,188 INFO L138 Inliner]: procedures = 279, calls = 120, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 360 [2025-02-06 09:27:21,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:27:21,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:27:21,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:27:21,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:27:21,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,200 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,200 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,213 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:27:21,221 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:27:21,221 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:27:21,221 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:27:21,222 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (1/1) ... [2025-02-06 09:27:21,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:27:21,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:27:21,257 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-02-06 09:27:21,262 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-02-06 09:27:21,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:27:21,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 09:27:21,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:27:21,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 09:27:21,293 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:27:21,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:27:21,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:27:21,293 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:27:21,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:27:21,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:27:21,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 09:27:21,293 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:27:21,294 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:27:21,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:27:21,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:27:21,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:27:21,295 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:27:21,461 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:27:21,463 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:27:21,898 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1061: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 09:27:21,898 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1061-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 09:27:21,999 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:27:21,999 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:27:22,034 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:27:22,034 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:27:22,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:27:22 BoogieIcfgContainer [2025-02-06 09:27:22,034 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:27:22,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:27:22,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:27:22,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:27:22,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:27:20" (1/3) ... [2025-02-06 09:27:22,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678b0d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:27:22, skipping insertion in model container [2025-02-06 09:27:22,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:21" (2/3) ... [2025-02-06 09:27:22,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678b0d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:27:22, skipping insertion in model container [2025-02-06 09:27:22,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:27:22" (3/3) ... [2025-02-06 09:27:22,043 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_91-arrayloop2_racefree.i [2025-02-06 09:27:22,055 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:27:22,057 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_91-arrayloop2_racefree.i that has 2 procedures, 386 locations, 1 initial locations, 11 loop locations, and 19 error locations. [2025-02-06 09:27:22,057 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:27:22,194 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:27:22,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 389 places, 405 transitions, 817 flow [2025-02-06 09:27:22,324 INFO L124 PetriNetUnfolderBase]: 19/435 cut-off events. [2025-02-06 09:27:22,326 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:27:22,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 435 events. 19/435 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 968 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 251. Up to 4 conditions per place. [2025-02-06 09:27:22,332 INFO L82 GeneralOperation]: Start removeDead. Operand has 389 places, 405 transitions, 817 flow [2025-02-06 09:27:22,337 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 389 places, 405 transitions, 817 flow [2025-02-06 09:27:22,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:27:22,360 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;@1f3ec2f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:27:22,360 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-02-06 09:27:22,391 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:27:22,391 INFO L124 PetriNetUnfolderBase]: 0/118 cut-off events. [2025-02-06 09:27:22,391 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:27:22,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:22,392 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-02-06 09:27:22,392 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:27:22,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:22,400 INFO L85 PathProgramCache]: Analyzing trace with hash 545318875, now seen corresponding path program 1 times [2025-02-06 09:27:22,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:22,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987748632] [2025-02-06 09:27:22,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:22,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:22,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 09:27:22,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 09:27:22,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:22,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:23,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:23,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987748632] [2025-02-06 09:27:23,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987748632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:23,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:23,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:23,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131695189] [2025-02-06 09:27:23,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:23,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:23,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:23,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:23,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:23,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 405 [2025-02-06 09:27:23,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 405 transitions, 817 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-02-06 09:27:23,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:23,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 405 [2025-02-06 09:27:23,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:24,152 INFO L124 PetriNetUnfolderBase]: 319/1629 cut-off events. [2025-02-06 09:27:24,156 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2025-02-06 09:27:24,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2319 conditions, 1629 events. 319/1629 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 10230 event pairs, 288 based on Foata normal form. 113/1612 useless extension candidates. Maximal degree in co-relation 1999. Up to 674 conditions per place. [2025-02-06 09:27:24,169 INFO L140 encePairwiseOnDemand]: 380/405 looper letters, 80 selfloop transitions, 10 changer transitions 0/388 dead transitions. [2025-02-06 09:27:24,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 388 transitions, 963 flow [2025-02-06 09:27:24,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1899 transitions. [2025-02-06 09:27:24,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7814814814814814 [2025-02-06 09:27:24,192 INFO L175 Difference]: Start difference. First operand has 389 places, 405 transitions, 817 flow. Second operand 6 states and 1899 transitions. [2025-02-06 09:27:24,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 388 transitions, 963 flow [2025-02-06 09:27:24,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 388 transitions, 963 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:27:24,208 INFO L231 Difference]: Finished difference. Result has 390 places, 388 transitions, 803 flow [2025-02-06 09:27:24,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=803, PETRI_PLACES=390, PETRI_TRANSITIONS=388} [2025-02-06 09:27:24,213 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, 1 predicate places. [2025-02-06 09:27:24,214 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 388 transitions, 803 flow [2025-02-06 09:27:24,215 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-02-06 09:27:24,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:24,216 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-02-06 09:27:24,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:27:24,216 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:27:24,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:24,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1303790608, now seen corresponding path program 1 times [2025-02-06 09:27:24,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:24,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536647535] [2025-02-06 09:27:24,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:24,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:24,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 09:27:24,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 09:27:24,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:24,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:24,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:24,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536647535] [2025-02-06 09:27:24,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536647535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:24,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:24,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:27:24,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449846906] [2025-02-06 09:27:24,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:24,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:24,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:24,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:24,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:24,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 405 [2025-02-06 09:27:24,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 388 transitions, 803 flow. Second operand has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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-02-06 09:27:24,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:24,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 405 [2025-02-06 09:27:24,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:24,428 INFO L124 PetriNetUnfolderBase]: 15/568 cut-off events. [2025-02-06 09:27:24,428 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-06 09:27:24,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 568 events. 15/568 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1685 event pairs, 8 based on Foata normal form. 1/525 useless extension candidates. Maximal degree in co-relation 402. Up to 34 conditions per place. [2025-02-06 09:27:24,431 INFO L140 encePairwiseOnDemand]: 402/405 looper letters, 15 selfloop transitions, 2 changer transitions 0/389 dead transitions. [2025-02-06 09:27:24,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 389 transitions, 839 flow [2025-02-06 09:27:24,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1143 transitions. [2025-02-06 09:27:24,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9407407407407408 [2025-02-06 09:27:24,434 INFO L175 Difference]: Start difference. First operand has 390 places, 388 transitions, 803 flow. Second operand 3 states and 1143 transitions. [2025-02-06 09:27:24,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 389 transitions, 839 flow [2025-02-06 09:27:24,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 389 transitions, 819 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:24,441 INFO L231 Difference]: Finished difference. Result has 388 places, 389 transitions, 795 flow [2025-02-06 09:27:24,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=795, PETRI_PLACES=388, PETRI_TRANSITIONS=389} [2025-02-06 09:27:24,443 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, -1 predicate places. [2025-02-06 09:27:24,443 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 389 transitions, 795 flow [2025-02-06 09:27:24,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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-02-06 09:27:24,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:24,444 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-02-06 09:27:24,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:27:24,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:27:24,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:24,445 INFO L85 PathProgramCache]: Analyzing trace with hash 852153344, now seen corresponding path program 1 times [2025-02-06 09:27:24,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:24,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752250372] [2025-02-06 09:27:24,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:24,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:24,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 09:27:24,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 09:27:24,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:24,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:24,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:24,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:24,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752250372] [2025-02-06 09:27:24,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752250372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:24,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:24,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:24,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679955233] [2025-02-06 09:27:24,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:24,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:24,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:24,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:24,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:25,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 405 [2025-02-06 09:27:25,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 389 transitions, 795 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-02-06 09:27:25,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:25,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 405 [2025-02-06 09:27:25,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:25,693 INFO L124 PetriNetUnfolderBase]: 320/1751 cut-off events. [2025-02-06 09:27:25,694 INFO L125 PetriNetUnfolderBase]: For 8/16 co-relation queries the response was YES. [2025-02-06 09:27:25,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2492 conditions, 1751 events. 320/1751 cut-off events. For 8/16 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 11036 event pairs, 288 based on Foata normal form. 0/1617 useless extension candidates. Maximal degree in co-relation 2228. Up to 708 conditions per place. [2025-02-06 09:27:25,705 INFO L140 encePairwiseOnDemand]: 393/405 looper letters, 80 selfloop transitions, 10 changer transitions 0/387 dead transitions. [2025-02-06 09:27:25,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 387 transitions, 971 flow [2025-02-06 09:27:25,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:25,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1886 transitions. [2025-02-06 09:27:25,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7761316872427984 [2025-02-06 09:27:25,710 INFO L175 Difference]: Start difference. First operand has 388 places, 389 transitions, 795 flow. Second operand 6 states and 1886 transitions. [2025-02-06 09:27:25,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 387 transitions, 971 flow [2025-02-06 09:27:25,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 387 transitions, 969 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:27:25,716 INFO L231 Difference]: Finished difference. Result has 390 places, 387 transitions, 809 flow [2025-02-06 09:27:25,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=809, PETRI_PLACES=390, PETRI_TRANSITIONS=387} [2025-02-06 09:27:25,718 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, 1 predicate places. [2025-02-06 09:27:25,719 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 387 transitions, 809 flow [2025-02-06 09:27:25,720 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-02-06 09:27:25,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:25,720 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-02-06 09:27:25,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:27:25,721 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:27:25,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:25,722 INFO L85 PathProgramCache]: Analyzing trace with hash 58793537, now seen corresponding path program 1 times [2025-02-06 09:27:25,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:25,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340437111] [2025-02-06 09:27:25,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:25,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:25,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 09:27:25,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 09:27:25,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:25,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:26,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:26,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:26,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340437111] [2025-02-06 09:27:26,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340437111] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:26,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:26,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:26,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651511167] [2025-02-06 09:27:26,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:26,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:26,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:26,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:26,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:26,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 405 [2025-02-06 09:27:26,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 387 transitions, 809 flow. Second operand has 6 states, 6 states have (on average 300.6666666666667) internal successors, (1804), 6 states have internal predecessors, (1804), 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-02-06 09:27:26,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:26,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 405 [2025-02-06 09:27:26,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:26,815 INFO L124 PetriNetUnfolderBase]: 320/1749 cut-off events. [2025-02-06 09:27:26,815 INFO L125 PetriNetUnfolderBase]: For 11/19 co-relation queries the response was YES. [2025-02-06 09:27:26,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2513 conditions, 1749 events. 320/1749 cut-off events. For 11/19 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 11020 event pairs, 288 based on Foata normal form. 0/1617 useless extension candidates. Maximal degree in co-relation 2128. Up to 722 conditions per place. [2025-02-06 09:27:26,823 INFO L140 encePairwiseOnDemand]: 399/405 looper letters, 87 selfloop transitions, 5 changer transitions 0/386 dead transitions. [2025-02-06 09:27:26,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 386 transitions, 991 flow [2025-02-06 09:27:26,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:26,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1881 transitions. [2025-02-06 09:27:26,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.774074074074074 [2025-02-06 09:27:26,827 INFO L175 Difference]: Start difference. First operand has 390 places, 387 transitions, 809 flow. Second operand 6 states and 1881 transitions. [2025-02-06 09:27:26,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 386 transitions, 991 flow [2025-02-06 09:27:26,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 386 transitions, 971 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:26,833 INFO L231 Difference]: Finished difference. Result has 389 places, 386 transitions, 797 flow [2025-02-06 09:27:26,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=797, PETRI_PLACES=389, PETRI_TRANSITIONS=386} [2025-02-06 09:27:26,834 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, 0 predicate places. [2025-02-06 09:27:26,834 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 386 transitions, 797 flow [2025-02-06 09:27:26,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 300.6666666666667) internal successors, (1804), 6 states have internal predecessors, (1804), 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-02-06 09:27:26,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:26,835 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-02-06 09:27:26,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:27:26,836 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:27:26,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:26,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1576974608, now seen corresponding path program 1 times [2025-02-06 09:27:26,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:26,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412725772] [2025-02-06 09:27:26,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:26,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:26,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 09:27:26,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 09:27:26,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:26,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:26,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:26,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412725772] [2025-02-06 09:27:26,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412725772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:26,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:26,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:27:26,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578730901] [2025-02-06 09:27:26,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:26,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:26,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:26,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:26,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:26,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 405 [2025-02-06 09:27:26,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 386 transitions, 797 flow. Second operand has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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-02-06 09:27:26,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:26,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 405 [2025-02-06 09:27:26,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:27,027 INFO L124 PetriNetUnfolderBase]: 15/750 cut-off events. [2025-02-06 09:27:27,027 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-06 09:27:27,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 750 events. 15/750 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1640 event pairs, 8 based on Foata normal form. 2/706 useless extension candidates. Maximal degree in co-relation 593. Up to 38 conditions per place. [2025-02-06 09:27:27,030 INFO L140 encePairwiseOnDemand]: 402/405 looper letters, 15 selfloop transitions, 2 changer transitions 0/387 dead transitions. [2025-02-06 09:27:27,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 387 transitions, 833 flow [2025-02-06 09:27:27,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:27,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:27,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1143 transitions. [2025-02-06 09:27:27,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9407407407407408 [2025-02-06 09:27:27,033 INFO L175 Difference]: Start difference. First operand has 389 places, 386 transitions, 797 flow. Second operand 3 states and 1143 transitions. [2025-02-06 09:27:27,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 387 transitions, 833 flow [2025-02-06 09:27:27,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 387 transitions, 823 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:27,038 INFO L231 Difference]: Finished difference. Result has 387 places, 387 transitions, 799 flow [2025-02-06 09:27:27,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=799, PETRI_PLACES=387, PETRI_TRANSITIONS=387} [2025-02-06 09:27:27,040 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, -2 predicate places. [2025-02-06 09:27:27,040 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 387 transitions, 799 flow [2025-02-06 09:27:27,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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-02-06 09:27:27,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:27,041 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-02-06 09:27:27,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:27:27,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:27:27,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:27,042 INFO L85 PathProgramCache]: Analyzing trace with hash -883587622, now seen corresponding path program 1 times [2025-02-06 09:27:27,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:27,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386279273] [2025-02-06 09:27:27,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:27,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:27,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 09:27:27,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 09:27:27,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:27,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:27,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:27,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:27,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386279273] [2025-02-06 09:27:27,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386279273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:27,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:27,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:27,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508931051] [2025-02-06 09:27:27,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:27,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:27,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:27,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:27,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:28,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 405 [2025-02-06 09:27:28,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 387 transitions, 799 flow. Second operand has 6 states, 6 states have (on average 327.5) internal successors, (1965), 6 states have internal predecessors, (1965), 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-02-06 09:27:28,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:28,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 405 [2025-02-06 09:27:28,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:28,155 INFO L124 PetriNetUnfolderBase]: 83/1076 cut-off events. [2025-02-06 09:27:28,155 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2025-02-06 09:27:28,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 1076 events. 83/1076 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3725 event pairs, 64 based on Foata normal form. 0/993 useless extension candidates. Maximal degree in co-relation 897. Up to 311 conditions per place. [2025-02-06 09:27:28,160 INFO L140 encePairwiseOnDemand]: 399/405 looper letters, 62 selfloop transitions, 5 changer transitions 0/386 dead transitions. [2025-02-06 09:27:28,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 386 transitions, 931 flow [2025-02-06 09:27:28,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:28,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:28,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2006 transitions. [2025-02-06 09:27:28,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8255144032921811 [2025-02-06 09:27:28,164 INFO L175 Difference]: Start difference. First operand has 387 places, 387 transitions, 799 flow. Second operand 6 states and 2006 transitions. [2025-02-06 09:27:28,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 386 transitions, 931 flow [2025-02-06 09:27:28,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 386 transitions, 929 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:27:28,174 INFO L231 Difference]: Finished difference. Result has 390 places, 386 transitions, 805 flow [2025-02-06 09:27:28,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=805, PETRI_PLACES=390, PETRI_TRANSITIONS=386} [2025-02-06 09:27:28,175 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, 1 predicate places. [2025-02-06 09:27:28,175 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 386 transitions, 805 flow [2025-02-06 09:27:28,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 327.5) internal successors, (1965), 6 states have internal predecessors, (1965), 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-02-06 09:27:28,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:28,177 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-02-06 09:27:28,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:27:28,178 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:27:28,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:28,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1508010218, now seen corresponding path program 1 times [2025-02-06 09:27:28,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:28,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018191809] [2025-02-06 09:27:28,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:28,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:28,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-06 09:27:28,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-06 09:27:28,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:28,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:28,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:27:28,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:28,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018191809] [2025-02-06 09:27:28,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018191809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:28,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:28,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:28,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80863919] [2025-02-06 09:27:28,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:28,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:28,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:28,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:28,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:28,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 405 [2025-02-06 09:27:28,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 386 transitions, 805 flow. Second operand has 6 states, 6 states have (on average 303.3333333333333) internal successors, (1820), 6 states have internal predecessors, (1820), 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-02-06 09:27:28,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:28,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 405 [2025-02-06 09:27:28,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:29,219 INFO L124 PetriNetUnfolderBase]: 320/1929 cut-off events. [2025-02-06 09:27:29,219 INFO L125 PetriNetUnfolderBase]: For 11/19 co-relation queries the response was YES. [2025-02-06 09:27:29,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2778 conditions, 1929 events. 320/1929 cut-off events. For 11/19 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 10976 event pairs, 288 based on Foata normal form. 0/1797 useless extension candidates. Maximal degree in co-relation 2272. Up to 788 conditions per place. [2025-02-06 09:27:29,227 INFO L140 encePairwiseOnDemand]: 399/405 looper letters, 87 selfloop transitions, 5 changer transitions 0/385 dead transitions. [2025-02-06 09:27:29,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 385 transitions, 987 flow [2025-02-06 09:27:29,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1881 transitions. [2025-02-06 09:27:29,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.774074074074074 [2025-02-06 09:27:29,234 INFO L175 Difference]: Start difference. First operand has 390 places, 386 transitions, 805 flow. Second operand 6 states and 1881 transitions. [2025-02-06 09:27:29,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 385 transitions, 987 flow [2025-02-06 09:27:29,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 385 transitions, 977 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:29,239 INFO L231 Difference]: Finished difference. Result has 389 places, 385 transitions, 803 flow [2025-02-06 09:27:29,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=803, PETRI_PLACES=389, PETRI_TRANSITIONS=385} [2025-02-06 09:27:29,241 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, 0 predicate places. [2025-02-06 09:27:29,241 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 385 transitions, 803 flow [2025-02-06 09:27:29,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 303.3333333333333) internal successors, (1820), 6 states have internal predecessors, (1820), 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-02-06 09:27:29,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:29,243 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-02-06 09:27:29,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:27:29,243 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:27:29,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:29,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1554209863, now seen corresponding path program 1 times [2025-02-06 09:27:29,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:29,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811271522] [2025-02-06 09:27:29,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:29,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:29,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 09:27:29,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 09:27:29,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:29,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:29,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:27:29,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:29,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811271522] [2025-02-06 09:27:29,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811271522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:29,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:29,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:29,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794005405] [2025-02-06 09:27:29,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:29,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:29,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:29,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:29,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:30,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 405 [2025-02-06 09:27:30,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 385 transitions, 803 flow. Second operand has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 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-02-06 09:27:30,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:30,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 405 [2025-02-06 09:27:30,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:30,369 INFO L124 PetriNetUnfolderBase]: 320/1925 cut-off events. [2025-02-06 09:27:30,370 INFO L125 PetriNetUnfolderBase]: For 11/19 co-relation queries the response was YES. [2025-02-06 09:27:30,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2758 conditions, 1925 events. 320/1925 cut-off events. For 11/19 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 10915 event pairs, 288 based on Foata normal form. 0/1797 useless extension candidates. Maximal degree in co-relation 2288. Up to 772 conditions per place. [2025-02-06 09:27:30,376 INFO L140 encePairwiseOnDemand]: 399/405 looper letters, 83 selfloop transitions, 5 changer transitions 0/384 dead transitions. [2025-02-06 09:27:30,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 384 transitions, 977 flow [2025-02-06 09:27:30,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:30,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:30,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1901 transitions. [2025-02-06 09:27:30,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7823045267489712 [2025-02-06 09:27:30,380 INFO L175 Difference]: Start difference. First operand has 389 places, 385 transitions, 803 flow. Second operand 6 states and 1901 transitions. [2025-02-06 09:27:30,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 384 transitions, 977 flow [2025-02-06 09:27:30,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 384 transitions, 967 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:30,386 INFO L231 Difference]: Finished difference. Result has 388 places, 384 transitions, 801 flow [2025-02-06 09:27:30,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=801, PETRI_PLACES=388, PETRI_TRANSITIONS=384} [2025-02-06 09:27:30,388 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, -1 predicate places. [2025-02-06 09:27:30,388 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 384 transitions, 801 flow [2025-02-06 09:27:30,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 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-02-06 09:27:30,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:30,389 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-02-06 09:27:30,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:27:30,390 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:27:30,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:30,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1378982131, now seen corresponding path program 1 times [2025-02-06 09:27:30,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:30,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752088014] [2025-02-06 09:27:30,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:30,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:30,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-06 09:27:30,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-06 09:27:30,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:30,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:27:30,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:30,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752088014] [2025-02-06 09:27:30,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752088014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:30,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:30,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:30,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528788457] [2025-02-06 09:27:30,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:30,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:30,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:30,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:30,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:31,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 405 [2025-02-06 09:27:31,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 384 transitions, 801 flow. Second operand has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 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-02-06 09:27:31,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:31,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 405 [2025-02-06 09:27:31,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:31,396 INFO L124 PetriNetUnfolderBase]: 320/1921 cut-off events. [2025-02-06 09:27:31,396 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2025-02-06 09:27:31,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2754 conditions, 1921 events. 320/1921 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 10876 event pairs, 288 based on Foata normal form. 0/1797 useless extension candidates. Maximal degree in co-relation 2303. Up to 772 conditions per place. [2025-02-06 09:27:31,403 INFO L140 encePairwiseOnDemand]: 399/405 looper letters, 83 selfloop transitions, 5 changer transitions 0/383 dead transitions. [2025-02-06 09:27:31,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 383 transitions, 975 flow [2025-02-06 09:27:31,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:31,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:31,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1901 transitions. [2025-02-06 09:27:31,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7823045267489712 [2025-02-06 09:27:31,407 INFO L175 Difference]: Start difference. First operand has 388 places, 384 transitions, 801 flow. Second operand 6 states and 1901 transitions. [2025-02-06 09:27:31,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 383 transitions, 975 flow [2025-02-06 09:27:31,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 383 transitions, 965 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:31,411 INFO L231 Difference]: Finished difference. Result has 387 places, 383 transitions, 799 flow [2025-02-06 09:27:31,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, 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-02-06 09:27:31,413 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, -2 predicate places. [2025-02-06 09:27:31,413 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 383 transitions, 799 flow [2025-02-06 09:27:31,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 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-02-06 09:27:31,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:31,414 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-02-06 09:27:31,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:27:31,414 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:27:31,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:31,415 INFO L85 PathProgramCache]: Analyzing trace with hash -726187879, now seen corresponding path program 1 times [2025-02-06 09:27:31,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:31,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236249966] [2025-02-06 09:27:31,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:31,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:31,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-06 09:27:31,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-06 09:27:31,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:31,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:31,895 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 09:27:31,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:31,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236249966] [2025-02-06 09:27:31,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236249966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:31,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:31,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:31,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492202578] [2025-02-06 09:27:31,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:31,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:31,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:31,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:31,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:32,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 405 [2025-02-06 09:27:32,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 383 transitions, 799 flow. Second operand has 6 states, 6 states have (on average 304.5) internal successors, (1827), 6 states have internal predecessors, (1827), 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-02-06 09:27:32,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:32,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 405 [2025-02-06 09:27:32,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:32,367 INFO L124 PetriNetUnfolderBase]: 320/1917 cut-off events. [2025-02-06 09:27:32,367 INFO L125 PetriNetUnfolderBase]: For 11/19 co-relation queries the response was YES. [2025-02-06 09:27:32,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2770 conditions, 1917 events. 320/1917 cut-off events. For 11/19 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 10862 event pairs, 288 based on Foata normal form. 0/1797 useless extension candidates. Maximal degree in co-relation 2316. Up to 792 conditions per place. [2025-02-06 09:27:32,375 INFO L140 encePairwiseOnDemand]: 399/405 looper letters, 88 selfloop transitions, 5 changer transitions 0/382 dead transitions. [2025-02-06 09:27:32,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 382 transitions, 983 flow [2025-02-06 09:27:32,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:32,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1876 transitions. [2025-02-06 09:27:32,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7720164609053498 [2025-02-06 09:27:32,379 INFO L175 Difference]: Start difference. First operand has 387 places, 383 transitions, 799 flow. Second operand 6 states and 1876 transitions. [2025-02-06 09:27:32,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 382 transitions, 983 flow [2025-02-06 09:27:32,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 382 transitions, 973 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:32,385 INFO L231 Difference]: Finished difference. Result has 386 places, 382 transitions, 797 flow [2025-02-06 09:27:32,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, 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-02-06 09:27:32,388 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, -3 predicate places. [2025-02-06 09:27:32,388 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 382 transitions, 797 flow [2025-02-06 09:27:32,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 304.5) internal successors, (1827), 6 states have internal predecessors, (1827), 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-02-06 09:27:32,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:32,390 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-02-06 09:27:32,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:27:32,391 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:27:32,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:32,392 INFO L85 PathProgramCache]: Analyzing trace with hash -765683204, now seen corresponding path program 1 times [2025-02-06 09:27:32,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:32,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39772794] [2025-02-06 09:27:32,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:32,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:32,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-06 09:27:32,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-06 09:27:32,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:32,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:32,554 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 09:27:32,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:32,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39772794] [2025-02-06 09:27:32,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39772794] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:27:32,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235394164] [2025-02-06 09:27:32,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:32,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:27:32,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:27:32,564 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-02-06 09:27:32,565 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-02-06 09:27:32,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-06 09:27:32,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-06 09:27:32,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:32,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:32,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 09:27:32,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:27:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 09:27:32,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:27:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 09:27:33,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235394164] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:27:33,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:27:33,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 09:27:33,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282209190] [2025-02-06 09:27:33,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:27:33,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:27:33,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:33,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:27:33,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:27:33,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 405 [2025-02-06 09:27:33,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 382 transitions, 797 flow. Second operand has 10 states, 10 states have (on average 373.8) internal successors, (3738), 10 states have internal predecessors, (3738), 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-02-06 09:27:33,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:33,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 405 [2025-02-06 09:27:33,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:33,241 INFO L124 PetriNetUnfolderBase]: 15/914 cut-off events. [2025-02-06 09:27:33,241 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-02-06 09:27:33,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 914 events. 15/914 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1063 event pairs, 8 based on Foata normal form. 4/892 useless extension candidates. Maximal degree in co-relation 799. Up to 38 conditions per place. [2025-02-06 09:27:33,245 INFO L140 encePairwiseOnDemand]: 399/405 looper letters, 19 selfloop transitions, 9 changer transitions 0/390 dead transitions. [2025-02-06 09:27:33,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 390 transitions, 871 flow [2025-02-06 09:27:33,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:27:33,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:27:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3378 transitions. [2025-02-06 09:27:33,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9267489711934156 [2025-02-06 09:27:33,251 INFO L175 Difference]: Start difference. First operand has 386 places, 382 transitions, 797 flow. Second operand 9 states and 3378 transitions. [2025-02-06 09:27:33,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 390 transitions, 871 flow [2025-02-06 09:27:33,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 390 transitions, 861 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:33,257 INFO L231 Difference]: Finished difference. Result has 392 places, 388 transitions, 837 flow [2025-02-06 09:27:33,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, 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=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=837, PETRI_PLACES=392, PETRI_TRANSITIONS=388} [2025-02-06 09:27:33,259 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, 3 predicate places. [2025-02-06 09:27:33,259 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 388 transitions, 837 flow [2025-02-06 09:27:33,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 373.8) internal successors, (3738), 10 states have internal predecessors, (3738), 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-02-06 09:27:33,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:33,262 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-02-06 09:27:33,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 09:27:33,462 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-02-06 09:27:33,463 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:27:33,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:33,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1746402068, now seen corresponding path program 2 times [2025-02-06 09:27:33,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:33,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846548689] [2025-02-06 09:27:33,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:27:33,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:33,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 401 statements into 2 equivalence classes. [2025-02-06 09:27:33,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 401 statements. [2025-02-06 09:27:33,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:27:33,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:33,735 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2025-02-06 09:27:33,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:33,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846548689] [2025-02-06 09:27:33,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846548689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:33,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:33,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:33,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071980474] [2025-02-06 09:27:33,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:33,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:33,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:33,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:33,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:34,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 405 [2025-02-06 09:27:34,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 388 transitions, 837 flow. Second operand has 6 states, 6 states have (on average 303.1666666666667) internal successors, (1819), 6 states have internal predecessors, (1819), 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-02-06 09:27:34,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:34,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 405 [2025-02-06 09:27:34,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:34,869 INFO L124 PetriNetUnfolderBase]: 739/3529 cut-off events. [2025-02-06 09:27:34,870 INFO L125 PetriNetUnfolderBase]: For 16/30 co-relation queries the response was YES. [2025-02-06 09:27:34,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5296 conditions, 3529 events. 739/3529 cut-off events. For 16/30 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 22934 event pairs, 323 based on Foata normal form. 4/3284 useless extension candidates. Maximal degree in co-relation 4632. Up to 1429 conditions per place. [2025-02-06 09:27:34,879 INFO L140 encePairwiseOnDemand]: 370/405 looper letters, 127 selfloop transitions, 118 changer transitions 0/537 dead transitions. [2025-02-06 09:27:34,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 537 transitions, 1625 flow [2025-02-06 09:27:34,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:34,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:34,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2016 transitions. [2025-02-06 09:27:34,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8296296296296296 [2025-02-06 09:27:34,884 INFO L175 Difference]: Start difference. First operand has 392 places, 388 transitions, 837 flow. Second operand 6 states and 2016 transitions. [2025-02-06 09:27:34,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 537 transitions, 1625 flow [2025-02-06 09:27:34,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 537 transitions, 1619 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 09:27:34,892 INFO L231 Difference]: Finished difference. Result has 401 places, 505 transitions, 1605 flow [2025-02-06 09:27:34,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1605, PETRI_PLACES=401, PETRI_TRANSITIONS=505} [2025-02-06 09:27:34,895 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, 12 predicate places. [2025-02-06 09:27:34,895 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 505 transitions, 1605 flow [2025-02-06 09:27:34,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 303.1666666666667) internal successors, (1819), 6 states have internal predecessors, (1819), 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-02-06 09:27:34,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:34,896 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-02-06 09:27:34,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:27:34,896 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:27:34,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:34,897 INFO L85 PathProgramCache]: Analyzing trace with hash 907651054, now seen corresponding path program 1 times [2025-02-06 09:27:34,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:34,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104858652] [2025-02-06 09:27:34,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:34,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:34,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-02-06 09:27:34,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-02-06 09:27:34,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:34,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:35,202 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2025-02-06 09:27:35,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:35,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104858652] [2025-02-06 09:27:35,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104858652] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:27:35,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173769555] [2025-02-06 09:27:35,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:35,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:27:35,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:27:35,211 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-02-06 09:27:35,212 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-02-06 09:27:35,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-02-06 09:27:35,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-02-06 09:27:35,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:35,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:35,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 1472 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 09:27:35,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:27:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2025-02-06 09:27:35,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:27:35,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173769555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:35,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:27:35,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-06 09:27:35,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416222319] [2025-02-06 09:27:35,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:35,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:35,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:35,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:35,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:35,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 405 [2025-02-06 09:27:35,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 505 transitions, 1605 flow. Second operand has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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-02-06 09:27:35,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:35,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 405 [2025-02-06 09:27:35,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:35,860 INFO L124 PetriNetUnfolderBase]: 309/2205 cut-off events. [2025-02-06 09:27:35,861 INFO L125 PetriNetUnfolderBase]: For 205/247 co-relation queries the response was YES. [2025-02-06 09:27:35,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3310 conditions, 2205 events. 309/2205 cut-off events. For 205/247 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 11160 event pairs, 21 based on Foata normal form. 2/2076 useless extension candidates. Maximal degree in co-relation 2781. Up to 340 conditions per place. [2025-02-06 09:27:35,872 INFO L140 encePairwiseOnDemand]: 402/405 looper letters, 22 selfloop transitions, 3 changer transitions 0/513 dead transitions. [2025-02-06 09:27:35,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 513 transitions, 1671 flow [2025-02-06 09:27:35,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:35,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1150 transitions. [2025-02-06 09:27:35,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9465020576131687 [2025-02-06 09:27:35,879 INFO L175 Difference]: Start difference. First operand has 401 places, 505 transitions, 1605 flow. Second operand 3 states and 1150 transitions. [2025-02-06 09:27:35,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 513 transitions, 1671 flow [2025-02-06 09:27:35,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 513 transitions, 1671 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:27:35,895 INFO L231 Difference]: Finished difference. Result has 404 places, 505 transitions, 1616 flow [2025-02-06 09:27:35,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=1605, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1616, PETRI_PLACES=404, PETRI_TRANSITIONS=505} [2025-02-06 09:27:35,896 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, 15 predicate places. [2025-02-06 09:27:35,897 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 505 transitions, 1616 flow [2025-02-06 09:27:35,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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-02-06 09:27:35,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:35,898 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-02-06 09:27:35,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 09:27:36,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:27:36,101 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:27:36,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:36,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1393835834, now seen corresponding path program 1 times [2025-02-06 09:27:36,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:36,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042235745] [2025-02-06 09:27:36,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:36,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:36,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-02-06 09:27:36,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-02-06 09:27:36,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:36,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:36,482 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2025-02-06 09:27:36,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:36,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042235745] [2025-02-06 09:27:36,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042235745] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:27:36,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731159180] [2025-02-06 09:27:36,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:36,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:27:36,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:27:36,486 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-02-06 09:27:36,499 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-02-06 09:27:36,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-02-06 09:27:36,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-02-06 09:27:36,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:36,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:36,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 1525 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 09:27:36,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:27:37,234 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 1 proven. 543 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-02-06 09:27:37,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:27:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 1 proven. 543 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-02-06 09:27:37,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731159180] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:27:37,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:27:37,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-02-06 09:27:37,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655693375] [2025-02-06 09:27:37,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:27:37,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 09:27:37,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:37,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 09:27:37,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-02-06 09:27:37,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 405 [2025-02-06 09:27:37,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 505 transitions, 1616 flow. Second operand has 19 states, 19 states have (on average 368.57894736842104) internal successors, (7003), 19 states have internal predecessors, (7003), 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-02-06 09:27:37,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:37,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 405 [2025-02-06 09:27:37,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:39,050 INFO L124 PetriNetUnfolderBase]: 262/3391 cut-off events. [2025-02-06 09:27:39,051 INFO L125 PetriNetUnfolderBase]: For 267/318 co-relation queries the response was YES. [2025-02-06 09:27:39,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4623 conditions, 3391 events. 262/3391 cut-off events. For 267/318 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 9515 event pairs, 8 based on Foata normal form. 13/3307 useless extension candidates. Maximal degree in co-relation 2524. Up to 345 conditions per place. [2025-02-06 09:27:39,060 INFO L140 encePairwiseOnDemand]: 394/405 looper letters, 51 selfloop transitions, 68 changer transitions 0/591 dead transitions. [2025-02-06 09:27:39,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 591 transitions, 2264 flow [2025-02-06 09:27:39,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-02-06 09:27:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-02-06 09:27:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 23190 transitions. [2025-02-06 09:27:39,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9088771310993533 [2025-02-06 09:27:39,077 INFO L175 Difference]: Start difference. First operand has 404 places, 505 transitions, 1616 flow. Second operand 63 states and 23190 transitions. [2025-02-06 09:27:39,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 591 transitions, 2264 flow [2025-02-06 09:27:39,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 591 transitions, 2258 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:39,143 INFO L231 Difference]: Finished difference. Result has 480 places, 567 transitions, 2130 flow [2025-02-06 09:27:39,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=1610, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=2130, PETRI_PLACES=480, PETRI_TRANSITIONS=567} [2025-02-06 09:27:39,149 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, 91 predicate places. [2025-02-06 09:27:39,149 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 567 transitions, 2130 flow [2025-02-06 09:27:39,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 368.57894736842104) internal successors, (7003), 19 states have internal predecessors, (7003), 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-02-06 09:27:39,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:39,155 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-02-06 09:27:39,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 09:27:39,355 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-02-06 09:27:39,356 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:27:39,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:39,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1571410878, now seen corresponding path program 2 times [2025-02-06 09:27:39,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:39,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610533828] [2025-02-06 09:27:39,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:27:39,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:39,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1434 statements into 2 equivalence classes. [2025-02-06 09:27:39,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 116 of 1434 statements. [2025-02-06 09:27:39,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:27:39,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 17069 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17069 trivial. 0 not checked. [2025-02-06 09:27:39,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:39,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610533828] [2025-02-06 09:27:39,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610533828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:39,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:39,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:39,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663257359] [2025-02-06 09:27:39,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:39,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:27:39,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:39,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:27:39,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:27:39,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 405 [2025-02-06 09:27:39,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 567 transitions, 2130 flow. Second operand has 5 states, 5 states have (on average 374.6) internal successors, (1873), 5 states have internal predecessors, (1873), 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-02-06 09:27:39,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:39,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 405 [2025-02-06 09:27:39,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:40,448 INFO L124 PetriNetUnfolderBase]: 304/3499 cut-off events. [2025-02-06 09:27:40,448 INFO L125 PetriNetUnfolderBase]: For 619/658 co-relation queries the response was YES. [2025-02-06 09:27:40,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4905 conditions, 3499 events. 304/3499 cut-off events. For 619/658 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 10013 event pairs, 0 based on Foata normal form. 10/3413 useless extension candidates. Maximal degree in co-relation 3254. Up to 364 conditions per place. [2025-02-06 09:27:40,457 INFO L140 encePairwiseOnDemand]: 400/405 looper letters, 34 selfloop transitions, 5 changer transitions 0/568 dead transitions. [2025-02-06 09:27:40,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 568 transitions, 2205 flow [2025-02-06 09:27:40,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2277 transitions. [2025-02-06 09:27:40,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.937037037037037 [2025-02-06 09:27:40,459 INFO L175 Difference]: Start difference. First operand has 480 places, 567 transitions, 2130 flow. Second operand 6 states and 2277 transitions. [2025-02-06 09:27:40,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 568 transitions, 2205 flow [2025-02-06 09:27:40,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 568 transitions, 2126 flow, removed 19 selfloop flow, removed 8 redundant places. [2025-02-06 09:27:40,471 INFO L231 Difference]: Finished difference. Result has 455 places, 544 transitions, 2010 flow [2025-02-06 09:27:40,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=2000, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2010, PETRI_PLACES=455, PETRI_TRANSITIONS=544} [2025-02-06 09:27:40,472 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, 66 predicate places. [2025-02-06 09:27:40,472 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 544 transitions, 2010 flow [2025-02-06 09:27:40,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 374.6) internal successors, (1873), 5 states have internal predecessors, (1873), 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-02-06 09:27:40,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:40,473 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-02-06 09:27:40,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:27:40,473 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:27:40,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:40,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1237618346, now seen corresponding path program 1 times [2025-02-06 09:27:40,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:40,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349259924] [2025-02-06 09:27:40,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:40,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:40,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1435 statements into 1 equivalence classes. [2025-02-06 09:27:40,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1435 of 1435 statements. [2025-02-06 09:27:40,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:40,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 17069 backedges. 8860 proven. 3787 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2025-02-06 09:27:42,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:42,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349259924] [2025-02-06 09:27:42,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349259924] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:27:42,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063121951] [2025-02-06 09:27:42,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:42,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:27:42,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:27:42,771 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-02-06 09:27:42,773 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-02-06 09:27:43,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1435 statements into 1 equivalence classes. [2025-02-06 09:27:43,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1435 of 1435 statements. [2025-02-06 09:27:43,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:43,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:43,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 5693 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 09:27:43,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:27:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 17069 backedges. 8860 proven. 3787 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2025-02-06 09:27:44,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:27:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 17069 backedges. 8860 proven. 3787 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2025-02-06 09:27:45,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063121951] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:27:45,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:27:45,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-02-06 09:27:45,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137827500] [2025-02-06 09:27:45,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:27:45,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 09:27:45,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:45,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 09:27:45,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 09:27:45,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 405 [2025-02-06 09:27:45,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 544 transitions, 2010 flow. Second operand has 34 states, 34 states have (on average 374.1470588235294) internal successors, (12721), 34 states have internal predecessors, (12721), 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-02-06 09:27:45,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:45,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 405 [2025-02-06 09:27:45,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:48,367 INFO L124 PetriNetUnfolderBase]: 251/5485 cut-off events. [2025-02-06 09:27:48,368 INFO L125 PetriNetUnfolderBase]: For 3390/3440 co-relation queries the response was YES. [2025-02-06 09:27:48,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7191 conditions, 5485 events. 251/5485 cut-off events. For 3390/3440 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8823 event pairs, 0 based on Foata normal form. 24/5423 useless extension candidates. Maximal degree in co-relation 4986. Up to 345 conditions per place. [2025-02-06 09:27:48,377 INFO L140 encePairwiseOnDemand]: 399/405 looper letters, 49 selfloop transitions, 135 changer transitions 0/645 dead transitions. [2025-02-06 09:27:48,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 645 transitions, 3142 flow [2025-02-06 09:27:48,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-02-06 09:27:48,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-02-06 09:27:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 16822 transitions. [2025-02-06 09:27:48,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9230178326474623 [2025-02-06 09:27:48,386 INFO L175 Difference]: Start difference. First operand has 455 places, 544 transitions, 2010 flow. Second operand 45 states and 16822 transitions. [2025-02-06 09:27:48,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 645 transitions, 3142 flow [2025-02-06 09:27:48,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 645 transitions, 3133 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 09:27:48,400 INFO L231 Difference]: Finished difference. Result has 504 places, 619 transitions, 2875 flow [2025-02-06 09:27:48,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=2001, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2875, PETRI_PLACES=504, PETRI_TRANSITIONS=619} [2025-02-06 09:27:48,401 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, 115 predicate places. [2025-02-06 09:27:48,401 INFO L471 AbstractCegarLoop]: Abstraction has has 504 places, 619 transitions, 2875 flow [2025-02-06 09:27:48,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 374.1470588235294) internal successors, (12721), 34 states have internal predecessors, (12721), 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-02-06 09:27:48,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:48,405 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-02-06 09:27:48,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 09:27:48,605 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-02-06 09:27:48,606 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:27:48,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:48,612 INFO L85 PathProgramCache]: Analyzing trace with hash 752321878, now seen corresponding path program 2 times [2025-02-06 09:27:48,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:48,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781045252] [2025-02-06 09:27:48,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:27:48,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:48,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2875 statements into 2 equivalence classes. [2025-02-06 09:27:49,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 2875 of 2875 statements. [2025-02-06 09:27:49,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:27:49,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:59,173 INFO L134 CoverageAnalysis]: Checked inductivity of 79741 backedges. 40556 proven. 18915 refuted. 0 times theorem prover too weak. 20270 trivial. 0 not checked. [2025-02-06 09:27:59,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:59,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781045252] [2025-02-06 09:27:59,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781045252] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:27:59,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792586950] [2025-02-06 09:27:59,174 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:27:59,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:27:59,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:27:59,178 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-02-06 09:27:59,182 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-02-06 09:28:00,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2875 statements into 2 equivalence classes. [2025-02-06 09:28:01,322 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 2875 of 2875 statements. [2025-02-06 09:28:01,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:28:01,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:01,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 11581 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 09:28:01,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:28:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 79741 backedges. 40556 proven. 18915 refuted. 0 times theorem prover too weak. 20270 trivial. 0 not checked. [2025-02-06 09:28:02,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:28:04,237 INFO L134 CoverageAnalysis]: Checked inductivity of 79741 backedges. 40556 proven. 18915 refuted. 0 times theorem prover too weak. 20270 trivial. 0 not checked. [2025-02-06 09:28:04,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792586950] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:28:04,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:28:04,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-02-06 09:28:04,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774628904] [2025-02-06 09:28:04,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:28:04,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-02-06 09:28:04,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:04,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-02-06 09:28:04,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-02-06 09:28:04,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 405 [2025-02-06 09:28:04,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 619 transitions, 2875 flow. Second operand has 63 states, 63 states have (on average 374.1111111111111) internal successors, (23569), 63 states have internal predecessors, (23569), 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-02-06 09:28:04,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:04,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 405 [2025-02-06 09:28:04,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:11,660 INFO L124 PetriNetUnfolderBase]: 251/9535 cut-off events. [2025-02-06 09:28:11,661 INFO L125 PetriNetUnfolderBase]: For 13598/13648 co-relation queries the response was YES. [2025-02-06 09:28:11,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12409 conditions, 9535 events. 251/9535 cut-off events. For 13598/13648 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8853 event pairs, 0 based on Foata normal form. 45/9494 useless extension candidates. Maximal degree in co-relation 10199. Up to 345 conditions per place. [2025-02-06 09:28:11,676 INFO L140 encePairwiseOnDemand]: 399/405 looper letters, 94 selfloop transitions, 270 changer transitions 0/825 dead transitions. [2025-02-06 09:28:11,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 825 transitions, 5789 flow [2025-02-06 09:28:11,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-02-06 09:28:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-02-06 09:28:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 33629 transitions. [2025-02-06 09:28:11,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9226063100137174 [2025-02-06 09:28:11,696 INFO L175 Difference]: Start difference. First operand has 504 places, 619 transitions, 2875 flow. Second operand 90 states and 33629 transitions. [2025-02-06 09:28:11,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 825 transitions, 5789 flow [2025-02-06 09:28:11,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 825 transitions, 5681 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-02-06 09:28:11,719 INFO L231 Difference]: Finished difference. Result has 591 places, 757 transitions, 4759 flow [2025-02-06 09:28:11,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=2767, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4759, PETRI_PLACES=591, PETRI_TRANSITIONS=757} [2025-02-06 09:28:11,720 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, 202 predicate places. [2025-02-06 09:28:11,720 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 757 transitions, 4759 flow [2025-02-06 09:28:11,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 374.1111111111111) internal successors, (23569), 63 states have internal predecessors, (23569), 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-02-06 09:28:11,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:11,726 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-02-06 09:28:11,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 09:28:11,931 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-02-06 09:28:11,931 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:28:11,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:11,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1047256022, now seen corresponding path program 3 times [2025-02-06 09:28:11,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:11,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276921660] [2025-02-06 09:28:11,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:28:11,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:12,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5575 statements into 40 equivalence classes. [2025-02-06 09:28:12,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 194 of 5575 statements. [2025-02-06 09:28:12,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 09:28:12,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:12,667 INFO L134 CoverageAnalysis]: Checked inductivity of 321451 backedges. 0 proven. 162091 refuted. 0 times theorem prover too weak. 159360 trivial. 0 not checked. [2025-02-06 09:28:12,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:12,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276921660] [2025-02-06 09:28:12,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276921660] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:28:12,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875011366] [2025-02-06 09:28:12,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:28:12,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:28:12,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:28:12,673 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-02-06 09:28:12,674 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-02-06 09:28:14,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5575 statements into 40 equivalence classes. [2025-02-06 09:28:15,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 194 of 5575 statements. [2025-02-06 09:28:15,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 09:28:15,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:15,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 09:28:15,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:28:19,962 INFO L134 CoverageAnalysis]: Checked inductivity of 321451 backedges. 0 proven. 162091 refuted. 0 times theorem prover too weak. 159360 trivial. 0 not checked. [2025-02-06 09:28:19,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:28:25,110 INFO L134 CoverageAnalysis]: Checked inductivity of 321451 backedges. 0 proven. 162091 refuted. 0 times theorem prover too weak. 159360 trivial. 0 not checked. [2025-02-06 09:28:25,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875011366] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:28:25,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:28:25,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-02-06 09:28:25,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040044079] [2025-02-06 09:28:25,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:28:25,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 09:28:25,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:25,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 09:28:25,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-02-06 09:28:25,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 405 [2025-02-06 09:28:25,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 757 transitions, 4759 flow. Second operand has 14 states, 14 states have (on average 373.92857142857144) internal successors, (5235), 14 states have internal predecessors, (5235), 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-02-06 09:28:25,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:25,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 405 [2025-02-06 09:28:25,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:47,457 INFO L124 PetriNetUnfolderBase]: 253/14997 cut-off events. [2025-02-06 09:28:47,458 INFO L125 PetriNetUnfolderBase]: For 6083/6133 co-relation queries the response was YES. [2025-02-06 09:28:47,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19159 conditions, 14997 events. 253/14997 cut-off events. For 6083/6133 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 8041 event pairs, 0 based on Foata normal form. 3/14914 useless extension candidates. Maximal degree in co-relation 16933. Up to 345 conditions per place. [2025-02-06 09:28:47,507 INFO L140 encePairwiseOnDemand]: 399/405 looper letters, 19 selfloop transitions, 15 changer transitions 0/770 dead transitions. [2025-02-06 09:28:47,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 770 transitions, 4873 flow [2025-02-06 09:28:47,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 09:28:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 09:28:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 5617 transitions. [2025-02-06 09:28:47,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9246090534979424 [2025-02-06 09:28:47,514 INFO L175 Difference]: Start difference. First operand has 591 places, 757 transitions, 4759 flow. Second operand 15 states and 5617 transitions. [2025-02-06 09:28:47,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 770 transitions, 4873 flow [2025-02-06 09:28:47,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 770 transitions, 4519 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-02-06 09:28:47,616 INFO L231 Difference]: Finished difference. Result has 567 places, 766 transitions, 4495 flow [2025-02-06 09:28:47,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=4405, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=757, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=748, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4495, PETRI_PLACES=567, PETRI_TRANSITIONS=766} [2025-02-06 09:28:47,622 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, 178 predicate places. [2025-02-06 09:28:47,622 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 766 transitions, 4495 flow [2025-02-06 09:28:47,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 373.92857142857144) internal successors, (5235), 14 states have internal predecessors, (5235), 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-02-06 09:28:47,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:47,630 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-02-06 09:28:47,660 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-02-06 09:28:47,831 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-02-06 09:28:47,831 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-06 09:28:47,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:47,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1756286094, now seen corresponding path program 4 times [2025-02-06 09:28:47,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:47,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872689021] [2025-02-06 09:28:47,870 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 09:28:47,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms