./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_90-arrayloop2_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_90-arrayloop2_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f41f3c018db74ffccd5759d166eb9816a1bf73b1747e3e539ecb5bf51feb56af --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:21:49,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:21:49,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:21:49,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:21:49,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:21:49,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:21:49,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:21:49,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:21:49,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:21:49,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:21:49,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:21:49,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:21:49,204 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:21:49,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:21:49,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:21:49,205 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:21:49,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:21:49,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:21:49,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:21:49,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:21:49,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:21:49,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:21:49,205 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:21:49,205 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:21:49,206 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:21:49,206 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:21:49,206 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:21:49,206 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:21:49,206 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:21:49,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:21:49,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:21:49,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:21:49,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:21:49,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:21:49,207 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:21:49,207 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:21:49,207 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:21:49,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:21:49,207 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:21:49,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:21:49,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:21:49,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:21:49,207 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f41f3c018db74ffccd5759d166eb9816a1bf73b1747e3e539ecb5bf51feb56af [2025-03-13 22:21:49,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:21:49,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:21:49,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:21:49,441 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:21:49,441 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:21:49,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_90-arrayloop2_racing.i [2025-03-13 22:21:50,565 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c589ebe91/047f2945928a47b780ceee5f17137585/FLAGfc3933442 [2025-03-13 22:21:50,897 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:21:50,898 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_90-arrayloop2_racing.i [2025-03-13 22:21:50,909 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c589ebe91/047f2945928a47b780ceee5f17137585/FLAGfc3933442 [2025-03-13 22:21:50,919 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c589ebe91/047f2945928a47b780ceee5f17137585 [2025-03-13 22:21:50,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:21:50,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:21:50,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:21:50,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:21:50,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:21:50,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:21:50" (1/1) ... [2025-03-13 22:21:50,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2791c400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:50, skipping insertion in model container [2025-03-13 22:21:50,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:21:50" (1/1) ... [2025-03-13 22:21:50,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:21:51,297 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:51,298 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:51,299 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:51,300 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:51,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:21:51,363 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:21:51,394 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:51,395 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:51,395 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:51,396 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:51,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:21:51,460 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:21:51,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51 WrapperNode [2025-03-13 22:21:51,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:21:51,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:21:51,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:21:51,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:21:51,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,515 INFO L138 Inliner]: procedures = 280, calls = 143, calls flagged for inlining = 11, calls inlined = 12, statements flattened = 526 [2025-03-13 22:21:51,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:21:51,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:21:51,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:21:51,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:21:51,523 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:21:51,568 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:21:51,568 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:21:51,568 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:21:51,569 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (1/1) ... [2025-03-13 22:21:51,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:21:51,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:21:51,598 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:21:51,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:21:51,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 22:21:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-13 22:21:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2025-03-13 22:21:51,618 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2025-03-13 22:21:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:21:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-13 22:21:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:21:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:21:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-03-13 22:21:51,618 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-03-13 22:21:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:21:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:21:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:21:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:21:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-13 22:21:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:21:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:21:51,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:21:51,620 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:21:51,754 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:21:51,756 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:21:52,475 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082: havoc main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset; [2025-03-13 22:21:52,476 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082-1: SUMMARY for call ULTIMATE.dealloc(main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset); srcloc: null [2025-03-13 22:21:52,476 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082-2: havoc main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset; [2025-03-13 22:21:52,476 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082-3: SUMMARY for call ULTIMATE.dealloc(main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset); srcloc: null [2025-03-13 22:21:52,477 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:21:52,477 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:21:52,478 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:21:52,521 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:21:52,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:21:52 BoogieIcfgContainer [2025-03-13 22:21:52,522 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:21:52,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:21:52,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:21:52,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:21:52,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:21:50" (1/3) ... [2025-03-13 22:21:52,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d546b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:21:52, skipping insertion in model container [2025-03-13 22:21:52,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:51" (2/3) ... [2025-03-13 22:21:52,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d546b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:21:52, skipping insertion in model container [2025-03-13 22:21:52,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:21:52" (3/3) ... [2025-03-13 22:21:52,531 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_90-arrayloop2_racing.i [2025-03-13 22:21:52,545 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:21:52,547 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_90-arrayloop2_racing.i that has 3 procedures, 544 locations, 1 initial locations, 18 loop locations, and 28 error locations. [2025-03-13 22:21:52,547 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:21:52,680 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-13 22:21:52,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 550 places, 583 transitions, 1186 flow [2025-03-13 22:21:52,929 INFO L124 PetriNetUnfolderBase]: 58/889 cut-off events. [2025-03-13 22:21:52,931 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-13 22:21:52,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 889 events. 58/889 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4186 event pairs, 0 based on Foata normal form. 0/780 useless extension candidates. Maximal degree in co-relation 497. Up to 8 conditions per place. [2025-03-13 22:21:52,956 INFO L82 GeneralOperation]: Start removeDead. Operand has 550 places, 583 transitions, 1186 flow [2025-03-13 22:21:52,969 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 550 places, 583 transitions, 1186 flow [2025-03-13 22:21:52,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:21:52,988 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;@1e0896e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:21:52,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-03-13 22:21:53,006 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:21:53,006 INFO L124 PetriNetUnfolderBase]: 0/119 cut-off events. [2025-03-13 22:21:53,006 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:21:53,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:21:53,007 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] [2025-03-13 22:21:53,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-13 22:21:53,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:21:53,013 INFO L85 PathProgramCache]: Analyzing trace with hash -183403118, now seen corresponding path program 1 times [2025-03-13 22:21:53,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:21:53,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789345637] [2025-03-13 22:21:53,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:21:53,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:21:53,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-13 22:21:53,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-13 22:21:53,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:21:53,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:21:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:21:53,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:21:53,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789345637] [2025-03-13 22:21:53,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789345637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:21:53,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:21:53,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:21:53,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289072227] [2025-03-13 22:21:53,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:21:53,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:21:53,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:21:53,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:21:53,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:21:54,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 583 [2025-03-13 22:21:54,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 583 transitions, 1186 flow. Second operand has 6 states, 6 states have (on average 416.3333333333333) internal successors, (2498), 6 states have internal predecessors, (2498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:21:54,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:21:54,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 583 [2025-03-13 22:21:54,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:06,254 INFO L124 PetriNetUnfolderBase]: 39310/99813 cut-off events. [2025-03-13 22:22:06,255 INFO L125 PetriNetUnfolderBase]: For 951/1142 co-relation queries the response was YES. [2025-03-13 22:22:06,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157956 conditions, 99813 events. 39310/99813 cut-off events. For 951/1142 co-relation queries the response was YES. Maximal size of possible extension queue 2071. Compared 1243425 event pairs, 34452 based on Foata normal form. 9525/100644 useless extension candidates. Maximal degree in co-relation 153775. Up to 57748 conditions per place. [2025-03-13 22:22:06,839 INFO L140 encePairwiseOnDemand]: 545/583 looper letters, 128 selfloop transitions, 10 changer transitions 0/551 dead transitions. [2025-03-13 22:22:06,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 551 transitions, 1398 flow [2025-03-13 22:22:06,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:06,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2656 transitions. [2025-03-13 22:22:06,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7592910234419669 [2025-03-13 22:22:06,864 INFO L175 Difference]: Start difference. First operand has 550 places, 583 transitions, 1186 flow. Second operand 6 states and 2656 transitions. [2025-03-13 22:22:06,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 551 transitions, 1398 flow [2025-03-13 22:22:06,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 551 transitions, 1398 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:22:06,889 INFO L231 Difference]: Finished difference. Result has 549 places, 551 transitions, 1142 flow [2025-03-13 22:22:06,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1142, PETRI_PLACES=549, PETRI_TRANSITIONS=551} [2025-03-13 22:22:06,895 INFO L279 CegarLoopForPetriNet]: 550 programPoint places, -1 predicate places. [2025-03-13 22:22:06,896 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 551 transitions, 1142 flow [2025-03-13 22:22:06,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 416.3333333333333) internal successors, (2498), 6 states have internal predecessors, (2498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:06,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:06,897 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] [2025-03-13 22:22:06,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:22:06,898 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-13 22:22:06,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:06,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1948844398, now seen corresponding path program 1 times [2025-03-13 22:22:06,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:06,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359311552] [2025-03-13 22:22:06,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:06,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:06,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-13 22:22:06,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-13 22:22:06,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:06,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:06,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:06,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359311552] [2025-03-13 22:22:06,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359311552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:06,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:06,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:22:06,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687818270] [2025-03-13 22:22:06,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:07,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:07,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:07,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:07,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:07,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 527 out of 583 [2025-03-13 22:22:07,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 551 transitions, 1142 flow. Second operand has 3 states, 3 states have (on average 528.3333333333334) internal successors, (1585), 3 states have internal predecessors, (1585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:07,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:07,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 527 of 583 [2025-03-13 22:22:07,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:07,744 INFO L124 PetriNetUnfolderBase]: 390/4202 cut-off events. [2025-03-13 22:22:07,745 INFO L125 PetriNetUnfolderBase]: For 186/187 co-relation queries the response was YES. [2025-03-13 22:22:07,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4874 conditions, 4202 events. 390/4202 cut-off events. For 186/187 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 38401 event pairs, 264 based on Foata normal form. 1/3814 useless extension candidates. Maximal degree in co-relation 4549. Up to 567 conditions per place. [2025-03-13 22:22:07,771 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 27 selfloop transitions, 2 changer transitions 0/552 dead transitions. [2025-03-13 22:22:07,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 552 transitions, 1202 flow [2025-03-13 22:22:07,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:07,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1611 transitions. [2025-03-13 22:22:07,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9210977701543739 [2025-03-13 22:22:07,776 INFO L175 Difference]: Start difference. First operand has 549 places, 551 transitions, 1142 flow. Second operand 3 states and 1611 transitions. [2025-03-13 22:22:07,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 552 transitions, 1202 flow [2025-03-13 22:22:07,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 552 transitions, 1182 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:07,789 INFO L231 Difference]: Finished difference. Result has 547 places, 552 transitions, 1134 flow [2025-03-13 22:22:07,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1134, PETRI_PLACES=547, PETRI_TRANSITIONS=552} [2025-03-13 22:22:07,791 INFO L279 CegarLoopForPetriNet]: 550 programPoint places, -3 predicate places. [2025-03-13 22:22:07,791 INFO L471 AbstractCegarLoop]: Abstraction has has 547 places, 552 transitions, 1134 flow [2025-03-13 22:22:07,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 528.3333333333334) internal successors, (1585), 3 states have internal predecessors, (1585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:07,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:07,793 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] [2025-03-13 22:22:07,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:22:07,793 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-13 22:22:07,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:07,795 INFO L85 PathProgramCache]: Analyzing trace with hash 544262974, now seen corresponding path program 1 times [2025-03-13 22:22:07,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:07,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838371236] [2025-03-13 22:22:07,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:07,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:07,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-13 22:22:07,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-13 22:22:07,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:07,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:08,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:08,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:08,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838371236] [2025-03-13 22:22:08,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838371236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:08,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:08,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:08,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819895063] [2025-03-13 22:22:08,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:08,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:08,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:08,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:08,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:08,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 583 [2025-03-13 22:22:08,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 552 transitions, 1134 flow. Second operand has 6 states, 6 states have (on average 416.3333333333333) internal successors, (2498), 6 states have internal predecessors, (2498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:08,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:08,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 583 [2025-03-13 22:22:08,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:20,689 INFO L124 PetriNetUnfolderBase]: 39311/99935 cut-off events. [2025-03-13 22:22:20,689 INFO L125 PetriNetUnfolderBase]: For 966/1157 co-relation queries the response was YES. [2025-03-13 22:22:20,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158129 conditions, 99935 events. 39311/99935 cut-off events. For 966/1157 co-relation queries the response was YES. Maximal size of possible extension queue 2072. Compared 1244894 event pairs, 34452 based on Foata normal form. 0/91237 useless extension candidates. Maximal degree in co-relation 157862. Up to 57782 conditions per place. [2025-03-13 22:22:21,211 INFO L140 encePairwiseOnDemand]: 571/583 looper letters, 128 selfloop transitions, 10 changer transitions 0/550 dead transitions. [2025-03-13 22:22:21,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 550 transitions, 1406 flow [2025-03-13 22:22:21,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2630 transitions. [2025-03-13 22:22:21,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7518582046883934 [2025-03-13 22:22:21,216 INFO L175 Difference]: Start difference. First operand has 547 places, 552 transitions, 1134 flow. Second operand 6 states and 2630 transitions. [2025-03-13 22:22:21,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 550 transitions, 1406 flow [2025-03-13 22:22:21,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 550 transitions, 1404 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:22:21,224 INFO L231 Difference]: Finished difference. Result has 549 places, 550 transitions, 1148 flow [2025-03-13 22:22:21,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1148, PETRI_PLACES=549, PETRI_TRANSITIONS=550} [2025-03-13 22:22:21,226 INFO L279 CegarLoopForPetriNet]: 550 programPoint places, -1 predicate places. [2025-03-13 22:22:21,226 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 550 transitions, 1148 flow [2025-03-13 22:22:21,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 416.3333333333333) internal successors, (2498), 6 states have internal predecessors, (2498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:21,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:21,228 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] [2025-03-13 22:22:21,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:22:21,228 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-13 22:22:21,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:21,229 INFO L85 PathProgramCache]: Analyzing trace with hash -111443769, now seen corresponding path program 1 times [2025-03-13 22:22:21,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:21,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469837870] [2025-03-13 22:22:21,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:21,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:21,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-13 22:22:21,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-13 22:22:21,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:21,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:21,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:21,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469837870] [2025-03-13 22:22:21,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469837870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:21,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:21,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:21,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025631339] [2025-03-13 22:22:21,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:21,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:21,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:21,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:21,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:22,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 583 [2025-03-13 22:22:22,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 550 transitions, 1148 flow. Second operand has 6 states, 6 states have (on average 416.6666666666667) internal successors, (2500), 6 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:22,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:22,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 583 [2025-03-13 22:22:22,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:32,669 INFO L124 PetriNetUnfolderBase]: 39311/99933 cut-off events. [2025-03-13 22:22:32,670 INFO L125 PetriNetUnfolderBase]: For 969/1160 co-relation queries the response was YES. [2025-03-13 22:22:32,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158150 conditions, 99933 events. 39311/99933 cut-off events. For 969/1160 co-relation queries the response was YES. Maximal size of possible extension queue 2072. Compared 1245112 event pairs, 34452 based on Foata normal form. 0/91237 useless extension candidates. Maximal degree in co-relation 157762. Up to 57796 conditions per place. [2025-03-13 22:22:33,161 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 135 selfloop transitions, 5 changer transitions 0/549 dead transitions. [2025-03-13 22:22:33,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 549 transitions, 1426 flow [2025-03-13 22:22:33,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:33,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2625 transitions. [2025-03-13 22:22:33,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7504288164665524 [2025-03-13 22:22:33,169 INFO L175 Difference]: Start difference. First operand has 549 places, 550 transitions, 1148 flow. Second operand 6 states and 2625 transitions. [2025-03-13 22:22:33,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 549 transitions, 1426 flow [2025-03-13 22:22:33,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 549 transitions, 1406 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:33,177 INFO L231 Difference]: Finished difference. Result has 548 places, 549 transitions, 1136 flow [2025-03-13 22:22:33,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1136, PETRI_PLACES=548, PETRI_TRANSITIONS=549} [2025-03-13 22:22:33,178 INFO L279 CegarLoopForPetriNet]: 550 programPoint places, -2 predicate places. [2025-03-13 22:22:33,178 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 549 transitions, 1136 flow [2025-03-13 22:22:33,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 416.6666666666667) internal successors, (2500), 6 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:33,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:33,180 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] [2025-03-13 22:22:33,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:22:33,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-13 22:22:33,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:33,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1772881151, now seen corresponding path program 1 times [2025-03-13 22:22:33,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:33,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054696187] [2025-03-13 22:22:33,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:33,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:33,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-13 22:22:33,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-13 22:22:33,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:33,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:33,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:33,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:33,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054696187] [2025-03-13 22:22:33,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054696187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:33,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:33,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:22:33,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870441569] [2025-03-13 22:22:33,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:33,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:33,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:33,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:33,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:33,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 527 out of 583 [2025-03-13 22:22:33,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 549 transitions, 1136 flow. Second operand has 3 states, 3 states have (on average 528.3333333333334) internal successors, (1585), 3 states have internal predecessors, (1585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:33,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:33,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 527 of 583 [2025-03-13 22:22:33,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:33,931 INFO L124 PetriNetUnfolderBase]: 390/4384 cut-off events. [2025-03-13 22:22:33,931 INFO L125 PetriNetUnfolderBase]: For 186/187 co-relation queries the response was YES. [2025-03-13 22:22:33,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5066 conditions, 4384 events. 390/4384 cut-off events. For 186/187 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 39177 event pairs, 264 based on Foata normal form. 2/3995 useless extension candidates. Maximal degree in co-relation 4634. Up to 571 conditions per place. [2025-03-13 22:22:33,960 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 27 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2025-03-13 22:22:33,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 550 transitions, 1196 flow [2025-03-13 22:22:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:33,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1611 transitions. [2025-03-13 22:22:33,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9210977701543739 [2025-03-13 22:22:33,963 INFO L175 Difference]: Start difference. First operand has 548 places, 549 transitions, 1136 flow. Second operand 3 states and 1611 transitions. [2025-03-13 22:22:33,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 550 transitions, 1196 flow [2025-03-13 22:22:33,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 550 transitions, 1186 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:33,970 INFO L231 Difference]: Finished difference. Result has 546 places, 550 transitions, 1138 flow [2025-03-13 22:22:33,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1138, PETRI_PLACES=546, PETRI_TRANSITIONS=550} [2025-03-13 22:22:33,971 INFO L279 CegarLoopForPetriNet]: 550 programPoint places, -4 predicate places. [2025-03-13 22:22:33,971 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 550 transitions, 1138 flow [2025-03-13 22:22:33,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 528.3333333333334) internal successors, (1585), 3 states have internal predecessors, (1585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:33,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:33,972 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] [2025-03-13 22:22:33,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:22:33,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-13 22:22:33,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:33,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1559504362, now seen corresponding path program 1 times [2025-03-13 22:22:33,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:33,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407848454] [2025-03-13 22:22:33,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:33,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:33,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-13 22:22:34,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-13 22:22:34,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:34,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:34,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:34,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407848454] [2025-03-13 22:22:34,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407848454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:34,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:34,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:34,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771658032] [2025-03-13 22:22:34,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:34,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:34,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:34,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:34,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:35,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 583 [2025-03-13 22:22:35,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 550 transitions, 1138 flow. Second operand has 6 states, 6 states have (on average 467.5) internal successors, (2805), 6 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:35,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:35,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 583 [2025-03-13 22:22:35,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:36,667 INFO L124 PetriNetUnfolderBase]: 3285/13864 cut-off events. [2025-03-13 22:22:36,667 INFO L125 PetriNetUnfolderBase]: For 246/345 co-relation queries the response was YES. [2025-03-13 22:22:36,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19161 conditions, 13864 events. 3285/13864 cut-off events. For 246/345 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 145611 event pairs, 2704 based on Foata normal form. 0/12261 useless extension candidates. Maximal degree in co-relation 18626. Up to 5147 conditions per place. [2025-03-13 22:22:36,747 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 86 selfloop transitions, 5 changer transitions 0/549 dead transitions. [2025-03-13 22:22:36,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 549 transitions, 1318 flow [2025-03-13 22:22:36,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:36,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2870 transitions. [2025-03-13 22:22:36,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8204688393367638 [2025-03-13 22:22:36,752 INFO L175 Difference]: Start difference. First operand has 546 places, 550 transitions, 1138 flow. Second operand 6 states and 2870 transitions. [2025-03-13 22:22:36,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 549 transitions, 1318 flow [2025-03-13 22:22:36,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 549 transitions, 1316 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:22:36,758 INFO L231 Difference]: Finished difference. Result has 549 places, 549 transitions, 1144 flow [2025-03-13 22:22:36,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1144, PETRI_PLACES=549, PETRI_TRANSITIONS=549} [2025-03-13 22:22:36,759 INFO L279 CegarLoopForPetriNet]: 550 programPoint places, -1 predicate places. [2025-03-13 22:22:36,759 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 549 transitions, 1144 flow [2025-03-13 22:22:36,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 467.5) internal successors, (2805), 6 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:36,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:36,760 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] [2025-03-13 22:22:36,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:22:36,761 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-13 22:22:36,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:36,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1325943149, now seen corresponding path program 1 times [2025-03-13 22:22:36,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:36,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709788418] [2025-03-13 22:22:36,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:36,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:36,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-13 22:22:36,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-13 22:22:36,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:36,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:37,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:37,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:37,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709788418] [2025-03-13 22:22:37,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709788418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:37,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:37,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:37,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963552383] [2025-03-13 22:22:37,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:37,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:37,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:37,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:37,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:37,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 583 [2025-03-13 22:22:37,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 549 transitions, 1144 flow. Second operand has 6 states, 6 states have (on average 419.3333333333333) internal successors, (2516), 6 states have internal predecessors, (2516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:37,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:37,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 583 [2025-03-13 22:22:37,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:50,717 INFO L124 PetriNetUnfolderBase]: 39311/100113 cut-off events. [2025-03-13 22:22:50,718 INFO L125 PetriNetUnfolderBase]: For 969/1160 co-relation queries the response was YES. [2025-03-13 22:22:50,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158415 conditions, 100113 events. 39311/100113 cut-off events. For 969/1160 co-relation queries the response was YES. Maximal size of possible extension queue 2073. Compared 1246273 event pairs, 34452 based on Foata normal form. 0/91417 useless extension candidates. Maximal degree in co-relation 157906. Up to 57862 conditions per place. [2025-03-13 22:22:51,267 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 135 selfloop transitions, 5 changer transitions 0/548 dead transitions. [2025-03-13 22:22:51,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 548 transitions, 1422 flow [2025-03-13 22:22:51,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2625 transitions. [2025-03-13 22:22:51,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7504288164665524 [2025-03-13 22:22:51,271 INFO L175 Difference]: Start difference. First operand has 549 places, 549 transitions, 1144 flow. Second operand 6 states and 2625 transitions. [2025-03-13 22:22:51,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 548 transitions, 1422 flow [2025-03-13 22:22:51,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 548 transitions, 1412 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:51,280 INFO L231 Difference]: Finished difference. Result has 548 places, 548 transitions, 1142 flow [2025-03-13 22:22:51,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1142, PETRI_PLACES=548, PETRI_TRANSITIONS=548} [2025-03-13 22:22:51,282 INFO L279 CegarLoopForPetriNet]: 550 programPoint places, -2 predicate places. [2025-03-13 22:22:51,283 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 548 transitions, 1142 flow [2025-03-13 22:22:51,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 419.3333333333333) internal successors, (2516), 6 states have internal predecessors, (2516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:51,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:51,284 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] [2025-03-13 22:22:51,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:22:51,285 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-13 22:22:51,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:51,290 INFO L85 PathProgramCache]: Analyzing trace with hash 912482614, now seen corresponding path program 1 times [2025-03-13 22:22:51,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:51,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270488293] [2025-03-13 22:22:51,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:51,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:51,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-13 22:22:51,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-13 22:22:51,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:51,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:51,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:51,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270488293] [2025-03-13 22:22:51,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270488293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:51,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:51,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:51,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032750540] [2025-03-13 22:22:51,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:51,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:51,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:51,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:51,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:52,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 583 [2025-03-13 22:22:52,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 548 transitions, 1142 flow. Second operand has 6 states, 6 states have (on average 424.0) internal successors, (2544), 6 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:22:52,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:52,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 583 [2025-03-13 22:22:52,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:05,363 INFO L124 PetriNetUnfolderBase]: 39311/100109 cut-off events. [2025-03-13 22:23:05,364 INFO L125 PetriNetUnfolderBase]: For 969/1160 co-relation queries the response was YES. [2025-03-13 22:23:05,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158395 conditions, 100109 events. 39311/100109 cut-off events. For 969/1160 co-relation queries the response was YES. Maximal size of possible extension queue 2073. Compared 1246017 event pairs, 34452 based on Foata normal form. 0/91417 useless extension candidates. Maximal degree in co-relation 157922. Up to 57846 conditions per place. [2025-03-13 22:23:05,870 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 131 selfloop transitions, 5 changer transitions 0/547 dead transitions. [2025-03-13 22:23:05,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 547 transitions, 1412 flow [2025-03-13 22:23:05,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:23:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:23:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2645 transitions. [2025-03-13 22:23:05,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7561463693539165 [2025-03-13 22:23:05,873 INFO L175 Difference]: Start difference. First operand has 548 places, 548 transitions, 1142 flow. Second operand 6 states and 2645 transitions. [2025-03-13 22:23:05,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 547 transitions, 1412 flow [2025-03-13 22:23:05,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 547 transitions, 1402 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:23:05,879 INFO L231 Difference]: Finished difference. Result has 547 places, 547 transitions, 1140 flow [2025-03-13 22:23:05,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1140, PETRI_PLACES=547, PETRI_TRANSITIONS=547} [2025-03-13 22:23:05,880 INFO L279 CegarLoopForPetriNet]: 550 programPoint places, -3 predicate places. [2025-03-13 22:23:05,881 INFO L471 AbstractCegarLoop]: Abstraction has has 547 places, 547 transitions, 1140 flow [2025-03-13 22:23:05,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 424.0) internal successors, (2544), 6 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:05,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:05,882 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] [2025-03-13 22:23:05,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:23:05,882 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-13 22:23:05,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:05,883 INFO L85 PathProgramCache]: Analyzing trace with hash 830824540, now seen corresponding path program 1 times [2025-03-13 22:23:05,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:05,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723335678] [2025-03-13 22:23:05,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:05,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:05,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-13 22:23:05,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-13 22:23:05,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:05,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:06,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:06,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:06,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723335678] [2025-03-13 22:23:06,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723335678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:06,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:06,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:23:06,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820810944] [2025-03-13 22:23:06,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:06,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:23:06,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:06,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:23:06,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:23:07,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 583 [2025-03-13 22:23:07,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 547 transitions, 1140 flow. Second operand has 6 states, 6 states have (on average 424.0) internal successors, (2544), 6 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:07,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:07,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 583 [2025-03-13 22:23:07,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand