./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 48c9605d
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-48c9605-m
[2025-02-08 05:32:39,393 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-08 05:32:39,448 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2025-02-08 05:32:39,455 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-08 05:32:39,455 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-08 05:32:39,477 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-08 05:32:39,478 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-08 05:32:39,478 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-08 05:32:39,478 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-08 05:32:39,479 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-08 05:32:39,479 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-08 05:32:39,480 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-08 05:32:39,480 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-08 05:32:39,480 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-08 05:32:39,480 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-08 05:32:39,480 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-08 05:32:39,480 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-08 05:32:39,480 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-08 05:32:39,480 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-08 05:32:39,481 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-08 05:32:39,481 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-08 05:32:39,481 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-08 05:32:39,481 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2025-02-08 05:32:39,481 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-02-08 05:32:39,481 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-08 05:32:39,481 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-08 05:32:39,481 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-08 05:32:39,481 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-08 05:32:39,481 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-08 05:32:39,481 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-08 05:32:39,482 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-08 05:32:39,482 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-08 05:32:39,482 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-08 05:32:39,482 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-08 05:32:39,482 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-08 05:32:39,482 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-08 05:32:39,482 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-08 05:32:39,483 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-08 05:32:39,483 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-08 05:32:39,483 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-08 05:32:39,483 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-08 05:32:39,483 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-08 05:32:39,483 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 -> b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430
[2025-02-08 05:32:39,688 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-08 05:32:39,707 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-08 05:32:39,710 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-08 05:32:39,711 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-08 05:32:39,711 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-08 05:32:39,712 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i
[2025-02-08 05:32:40,847 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef2768502/23b967cf2f7b4df38fd158af00fd7de4/FLAGdb1fc0a38
[2025-02-08 05:32:41,141 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-08 05:32:41,142 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i
[2025-02-08 05:32:41,164 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef2768502/23b967cf2f7b4df38fd158af00fd7de4/FLAGdb1fc0a38
[2025-02-08 05:32:41,442 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef2768502/23b967cf2f7b4df38fd158af00fd7de4
[2025-02-08 05:32:41,444 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-08 05:32:41,445 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-08 05:32:41,450 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-08 05:32:41,450 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-08 05:32:41,459 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-08 05:32:41,460 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:32:41" (1/1) ...
[2025-02-08 05:32:41,460 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f93a7da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:41, skipping insertion in model container
[2025-02-08 05:32:41,460 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:32:41" (1/1) ...
[2025-02-08 05:32:41,534 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-08 05:32:42,172 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 05:32:42,208 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-08 05:32:42,261 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 05:32:42,318 INFO  L204         MainTranslator]: Completed translation
[2025-02-08 05:32:42,319 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42 WrapperNode
[2025-02-08 05:32:42,320 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-08 05:32:42,320 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-08 05:32:42,320 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-08 05:32:42,320 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-08 05:32:42,326 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ...
[2025-02-08 05:32:42,338 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ...
[2025-02-08 05:32:42,360 INFO  L138                Inliner]: procedures = 370, calls = 86, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 283
[2025-02-08 05:32:42,361 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-08 05:32:42,361 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-08 05:32:42,361 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-08 05:32:42,361 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-08 05:32:42,371 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ...
[2025-02-08 05:32:42,371 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ...
[2025-02-08 05:32:42,375 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ...
[2025-02-08 05:32:42,376 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ...
[2025-02-08 05:32:42,388 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ...
[2025-02-08 05:32:42,389 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ...
[2025-02-08 05:32:42,391 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ...
[2025-02-08 05:32:42,391 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ...
[2025-02-08 05:32:42,394 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-08 05:32:42,394 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-08 05:32:42,394 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-08 05:32:42,394 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-08 05:32:42,395 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ...
[2025-02-08 05:32:42,399 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-08 05:32:42,407 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 05:32:42,420 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-08 05:32:42,422 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-08 05:32:42,437 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2025-02-08 05:32:42,437 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2025-02-08 05:32:42,437 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2025-02-08 05:32:42,437 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2025-02-08 05:32:42,437 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2025-02-08 05:32:42,438 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2025-02-08 05:32:42,438 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2025-02-08 05:32:42,438 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-08 05:32:42,438 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2025-02-08 05:32:42,438 INFO  L130     BoogieDeclarations]: Found specification of procedure t_fun
[2025-02-08 05:32:42,438 INFO  L138     BoogieDeclarations]: Found implementation of procedure t_fun
[2025-02-08 05:32:42,438 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2025-02-08 05:32:42,438 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-08 05:32:42,438 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-08 05:32:42,439 WARN  L227             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2025-02-08 05:32:42,562 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-08 05:32:42,563 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-08 05:32:43,028 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1258-1: havoc main_#t~post54#1;
[2025-02-08 05:32:43,028 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1258-2: main_~j~0#1 := 1 + main_#t~post54#1;
[2025-02-08 05:32:43,028 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1258-3: main_#t~post54#1 := main_~j~0#1;
[2025-02-08 05:32:43,028 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1260: havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;
[2025-02-08 05:32:43,028 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-1: assume { :end_inline_list_add } true;havoc main_#t~ret47#1.base, main_#t~ret47#1.offset;
[2025-02-08 05:32:43,028 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-2: havoc list_add_#in~node#1.base, list_add_#in~node#1.offset, list_add_#in~list#1.base, list_add_#in~list#1.offset;
[2025-02-08 05:32:43,028 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-3: havoc list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset, list_add_#t~nondet34#1, list_add_#t~nondet35#1, list_add_~node#1.base, list_add_~node#1.offset, list_add_~list#1.base, list_add_~list#1.offset, list_add_~temp~0#1.base, list_add_~temp~0#1.offset;
[2025-02-08 05:32:43,028 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-4: havoc list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset, list_add_#t~nondet34#1, list_add_#t~nondet35#1, list_add_~node#1.base, list_add_~node#1.offset, list_add_~list#1.base, list_add_~list#1.offset, list_add_~temp~0#1.base, list_add_~temp~0#1.offset;
[2025-02-08 05:32:43,028 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-5: assume ((0 == #race[~#slot~0.base,~#slot~0.offset + 4 * main_~j~0#1] && 0 == #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~j~0#1)]) && 0 == #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~j~0#1)]) && 0 == #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~j~0#1)];
[2025-02-08 05:32:43,028 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-5: assume !(((0 == #race[~#slot~0.base,~#slot~0.offset + 4 * main_~j~0#1] && 0 == #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~j~0#1)]) && 0 == #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~j~0#1)]) && 0 == #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~j~0#1)]);
[2025-02-08 05:32:43,028 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-6: assume { :begin_inline_list_add } true;list_add_#in~node#1.base, list_add_#in~node#1.offset, list_add_#in~list#1.base, list_add_#in~list#1.offset := main_#t~ret47#1.base, main_#t~ret47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset;
[2025-02-08 05:32:43,028 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-7: #race := #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~j~0#1) := 0];
[2025-02-08 05:32:43,028 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-8: #race := #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~j~0#1) := 0];
[2025-02-08 05:32:43,028 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-9: #race := #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~j~0#1) := 0];
[2025-02-08 05:32:43,028 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-10: #race := #race[~#slot~0.base,~#slot~0.offset + 4 * main_~j~0#1 := 0];
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-11: SUMMARY for call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(~#slot~0.base, ~#slot~0.offset + 4 * main_~j~0#1, 4); srcloc: null
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-12: havoc new_#in~x#1;assume { :end_inline_new } true;
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-13: havoc new_#t~malloc30#1.base, new_#t~malloc30#1.offset, new_#t~nondet31#1, new_#t~nondet32#1, new_~x#1, new_~p~0#1.base, new_~p~0#1.offset;
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-14: main_#t~ret47#1.base, main_#t~ret47#1.offset := new_#res#1.base, new_#res#1.offset;
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1261: havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-1: havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-2: assume ((0 == #race[main_#t~mem49#1.base,4 + main_#t~mem49#1.offset] && 0 == #race[main_#t~mem49#1.base,5 + main_#t~mem49#1.offset]) && 0 == #race[main_#t~mem49#1.base,6 + main_#t~mem49#1.offset]) && 0 == #race[main_#t~mem49#1.base,7 + main_#t~mem49#1.offset];
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-2: assume !(((0 == #race[main_#t~mem49#1.base,4 + main_#t~mem49#1.offset] && 0 == #race[main_#t~mem49#1.base,5 + main_#t~mem49#1.offset]) && 0 == #race[main_#t~mem49#1.base,6 + main_#t~mem49#1.offset]) && 0 == #race[main_#t~mem49#1.base,7 + main_#t~mem49#1.offset]);
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-3: main_~p~1#1.base, main_~p~1#1.offset := main_#t~mem50#1.base, main_#t~mem50#1.offset;
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-4: #race := #race[main_#t~mem49#1.base,7 + main_#t~mem49#1.offset := 0];
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-5: #race := #race[main_#t~mem49#1.base,6 + main_#t~mem49#1.offset := 0];
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-6: #race := #race[main_#t~mem49#1.base,5 + main_#t~mem49#1.offset := 0];
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-7: #race := #race[main_#t~mem49#1.base,4 + main_#t~mem49#1.offset := 0];
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-8: SUMMARY for call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 4 + main_#t~mem49#1.offset, 4); srcloc: null
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-9: assume ((0 == #race[~#slot~0.base,~#slot~0.offset + 4 * main_~j~0#1] && 0 == #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~j~0#1)]) && 0 == #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~j~0#1)]) && 0 == #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~j~0#1)];
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-9: assume !(((0 == #race[~#slot~0.base,~#slot~0.offset + 4 * main_~j~0#1] && 0 == #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~j~0#1)]) && 0 == #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~j~0#1)]) && 0 == #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~j~0#1)]);
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-10: #race := #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~j~0#1) := 0];
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-11: #race := #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~j~0#1) := 0];
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-12: #race := #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~j~0#1) := 0];
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-13: #race := #race[~#slot~0.base,~#slot~0.offset + 4 * main_~j~0#1 := 0];
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-14: SUMMARY for call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(~#slot~0.base, ~#slot~0.offset + 4 * main_~j~0#1, 4); srcloc: null
[2025-02-08 05:32:43,029 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1262: havoc main_#t~mem52#1;
[2025-02-08 05:32:43,030 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-1: assume ((0 == #race[main_~p~1#1.base,main_~p~1#1.offset] && 0 == #race[main_~p~1#1.base,1 + main_~p~1#1.offset]) && 0 == #race[main_~p~1#1.base,2 + main_~p~1#1.offset]) && 0 == #race[main_~p~1#1.base,3 + main_~p~1#1.offset];
[2025-02-08 05:32:43,030 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-1: assume !(((0 == #race[main_~p~1#1.base,main_~p~1#1.offset] && 0 == #race[main_~p~1#1.base,1 + main_~p~1#1.offset]) && 0 == #race[main_~p~1#1.base,2 + main_~p~1#1.offset]) && 0 == #race[main_~p~1#1.base,3 + main_~p~1#1.offset]);
[2025-02-08 05:32:43,030 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-2: havoc main_#t~ret51#1;
[2025-02-08 05:32:43,030 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-3: #race := #race[main_~p~1#1.base,3 + main_~p~1#1.offset := 0];
[2025-02-08 05:32:43,030 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-4: #race := #race[main_~p~1#1.base,2 + main_~p~1#1.offset := 0];
[2025-02-08 05:32:43,030 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-5: #race := #race[main_~p~1#1.base,1 + main_~p~1#1.offset := 0];
[2025-02-08 05:32:43,030 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-6: #race := #race[main_~p~1#1.base,main_~p~1#1.offset := 0];
[2025-02-08 05:32:43,030 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-7: SUMMARY for call main_#t~mem52#1 := read~int(main_~p~1#1.base, main_~p~1#1.offset, 4); srcloc: null
[2025-02-08 05:32:43,030 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1262-8: havoc main_#t~ret51#1;
[2025-02-08 05:32:43,030 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1263: havoc main_#t~ret53#1;
[2025-02-08 05:32:43,030 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1263-1: 
[2025-02-08 05:32:43,030 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1263-2: SUMMARY for call main_#t~ret53#1 := #PthreadsMutexUnlock(~#mutex~0.base, ~#mutex~0.offset + 24 * main_~j~0#1); srcloc: null
[2025-02-08 05:32:43,030 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1263-3: 
[2025-02-08 05:32:43,030 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1233: list_add_~list#1.base, list_add_~list#1.offset := list_add_#in~list#1.base, list_add_#in~list#1.offset;
[2025-02-08 05:32:43,030 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1233-1: list_add_~node#1.base, list_add_~node#1.offset := list_add_#in~node#1.base, list_add_#in~node#1.offset;
[2025-02-08 05:32:43,030 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1234: havoc list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset;
[2025-02-08 05:32:43,030 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-1: assume ((0 == #race[list_add_~list#1.base,4 + list_add_~list#1.offset] && 0 == #race[list_add_~list#1.base,5 + list_add_~list#1.offset]) && 0 == #race[list_add_~list#1.base,6 + list_add_~list#1.offset]) && 0 == #race[list_add_~list#1.base,7 + list_add_~list#1.offset];
[2025-02-08 05:32:43,030 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-1: assume !(((0 == #race[list_add_~list#1.base,4 + list_add_~list#1.offset] && 0 == #race[list_add_~list#1.base,5 + list_add_~list#1.offset]) && 0 == #race[list_add_~list#1.base,6 + list_add_~list#1.offset]) && 0 == #race[list_add_~list#1.base,7 + list_add_~list#1.offset]);
[2025-02-08 05:32:43,033 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-2: list_add_~temp~0#1.base, list_add_~temp~0#1.offset := list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset;
[2025-02-08 05:32:43,033 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-3: #race := #race[list_add_~list#1.base,7 + list_add_~list#1.offset := 0];
[2025-02-08 05:32:43,033 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-4: #race := #race[list_add_~list#1.base,6 + list_add_~list#1.offset := 0];
[2025-02-08 05:32:43,033 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-5: #race := #race[list_add_~list#1.base,5 + list_add_~list#1.offset := 0];
[2025-02-08 05:32:43,033 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-6: #race := #race[list_add_~list#1.base,4 + list_add_~list#1.offset := 0];
[2025-02-08 05:32:43,033 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-7: SUMMARY for call list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset := read~$Pointer$(list_add_~list#1.base, 4 + list_add_~list#1.offset, 4); srcloc: null
[2025-02-08 05:32:43,033 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1235: assume ((#race[list_add_~list#1.base,4 + list_add_~list#1.offset] == list_add_#t~nondet34#1 && #race[list_add_~list#1.base,5 + list_add_~list#1.offset] == list_add_#t~nondet34#1) && #race[list_add_~list#1.base,6 + list_add_~list#1.offset] == list_add_#t~nondet34#1) && #race[list_add_~list#1.base,7 + list_add_~list#1.offset] == list_add_#t~nondet34#1;
[2025-02-08 05:32:43,033 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1235: assume !(((#race[list_add_~list#1.base,4 + list_add_~list#1.offset] == list_add_#t~nondet34#1 && #race[list_add_~list#1.base,5 + list_add_~list#1.offset] == list_add_#t~nondet34#1) && #race[list_add_~list#1.base,6 + list_add_~list#1.offset] == list_add_#t~nondet34#1) && #race[list_add_~list#1.base,7 + list_add_~list#1.offset] == list_add_#t~nondet34#1);
[2025-02-08 05:32:43,033 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-1: havoc list_add_#t~nondet34#1;
[2025-02-08 05:32:43,033 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-2: #race := #race[list_add_~list#1.base,7 + list_add_~list#1.offset := list_add_#t~nondet34#1];
[2025-02-08 05:32:43,033 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-3: #race := #race[list_add_~list#1.base,6 + list_add_~list#1.offset := list_add_#t~nondet34#1];
[2025-02-08 05:32:43,033 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-4: #race := #race[list_add_~list#1.base,5 + list_add_~list#1.offset := list_add_#t~nondet34#1];
[2025-02-08 05:32:43,033 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-5: #race := #race[list_add_~list#1.base,4 + list_add_~list#1.offset := list_add_#t~nondet34#1];
[2025-02-08 05:32:43,033 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-6: havoc list_add_#t~nondet34#1;
[2025-02-08 05:32:43,033 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-7: SUMMARY for call write~$Pointer$(list_add_~node#1.base, list_add_~node#1.offset, list_add_~list#1.base, 4 + list_add_~list#1.offset, 4); srcloc: null
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1236: assume ((#race[list_add_~node#1.base,4 + list_add_~node#1.offset] == list_add_#t~nondet35#1 && #race[list_add_~node#1.base,5 + list_add_~node#1.offset] == list_add_#t~nondet35#1) && #race[list_add_~node#1.base,6 + list_add_~node#1.offset] == list_add_#t~nondet35#1) && #race[list_add_~node#1.base,7 + list_add_~node#1.offset] == list_add_#t~nondet35#1;
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1236: assume !(((#race[list_add_~node#1.base,4 + list_add_~node#1.offset] == list_add_#t~nondet35#1 && #race[list_add_~node#1.base,5 + list_add_~node#1.offset] == list_add_#t~nondet35#1) && #race[list_add_~node#1.base,6 + list_add_~node#1.offset] == list_add_#t~nondet35#1) && #race[list_add_~node#1.base,7 + list_add_~node#1.offset] == list_add_#t~nondet35#1);
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-1: havoc list_add_#t~nondet35#1;
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-2: #race := #race[list_add_~node#1.base,7 + list_add_~node#1.offset := list_add_#t~nondet35#1];
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-3: #race := #race[list_add_~node#1.base,6 + list_add_~node#1.offset := list_add_#t~nondet35#1];
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-4: #race := #race[list_add_~node#1.base,5 + list_add_~node#1.offset := list_add_#t~nondet35#1];
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-5: #race := #race[list_add_~node#1.base,4 + list_add_~node#1.offset := list_add_#t~nondet35#1];
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-6: havoc list_add_#t~nondet35#1;
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-7: SUMMARY for call write~$Pointer$(list_add_~temp~0#1.base, list_add_~temp~0#1.offset, list_add_~node#1.base, 4 + list_add_~node#1.offset, 4); srcloc: null
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1253-1: havoc main_#t~post43#1;
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1253-2: main_~j~0#1 := 1 + main_#t~post43#1;
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1253-3: main_#t~post43#1 := main_~j~0#1;
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1255: havoc main_#t~nondet42#1;
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-1: assume ((#race[~#slot~0.base,~#slot~0.offset + 4 * main_~j~0#1] == main_#t~nondet42#1 && #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~j~0#1)] == main_#t~nondet42#1) && #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~j~0#1)] == main_#t~nondet42#1) && #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~j~0#1)] == main_#t~nondet42#1;
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-1: assume !(((#race[~#slot~0.base,~#slot~0.offset + 4 * main_~j~0#1] == main_#t~nondet42#1 && #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~j~0#1)] == main_#t~nondet42#1) && #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~j~0#1)] == main_#t~nondet42#1) && #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~j~0#1)] == main_#t~nondet42#1);
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-2: havoc main_#t~ret41#1.base, main_#t~ret41#1.offset;
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-3: #race := #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~j~0#1) := main_#t~nondet42#1];
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-4: #race := #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~j~0#1) := main_#t~nondet42#1];
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-5: #race := #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~j~0#1) := main_#t~nondet42#1];
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-6: #race := #race[~#slot~0.base,~#slot~0.offset + 4 * main_~j~0#1 := main_#t~nondet42#1];
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-7: havoc main_#t~nondet42#1;
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-8: SUMMARY for call write~$Pointer$(main_#t~ret41#1.base, main_#t~ret41#1.offset, ~#slot~0.base, ~#slot~0.offset + 4 * main_~j~0#1, 4); srcloc: null
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-9: havoc new_#in~x#1;assume { :end_inline_new } true;
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-10: havoc new_#t~malloc30#1.base, new_#t~malloc30#1.offset, new_#t~nondet31#1, new_#t~nondet32#1, new_~x#1, new_~p~0#1.base, new_~p~0#1.offset;
[2025-02-08 05:32:43,034 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1255-11: main_#t~ret41#1.base, main_#t~ret41#1.offset := new_#res#1.base, new_#res#1.offset;
[2025-02-08 05:32:43,125 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1245: havoc #t~ret39#1;
[2025-02-08 05:32:43,125 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1245-1: 
[2025-02-08 05:32:43,125 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1245-2: SUMMARY for call #t~ret39#1 := #PthreadsMutexUnlock(~#mutex~0.base, ~#mutex~0.offset + 24 * ~i~0#1); srcloc: null
[2025-02-08 05:32:43,126 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1245-3: 
[2025-02-08 05:32:43,126 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1233: list_add_~list#1.base, list_add_~list#1.offset := list_add_#in~list#1.base, list_add_#in~list#1.offset;
[2025-02-08 05:32:43,126 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1233-1: list_add_~node#1.base, list_add_~node#1.offset := list_add_#in~node#1.base, list_add_#in~node#1.offset;
[2025-02-08 05:32:43,126 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1242-1: havoc #t~post40#1;
[2025-02-08 05:32:43,126 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1242-2: ~i~0#1 := 1 + #t~post40#1;
[2025-02-08 05:32:43,126 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1242-3: #t~post40#1 := ~i~0#1;
[2025-02-08 05:32:43,126 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1234: havoc list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset;
[2025-02-08 05:32:43,126 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-1: assume ((0 == #race[list_add_~list#1.base,4 + list_add_~list#1.offset] && 0 == #race[list_add_~list#1.base,5 + list_add_~list#1.offset]) && 0 == #race[list_add_~list#1.base,6 + list_add_~list#1.offset]) && 0 == #race[list_add_~list#1.base,7 + list_add_~list#1.offset];
[2025-02-08 05:32:43,126 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-1: assume !(((0 == #race[list_add_~list#1.base,4 + list_add_~list#1.offset] && 0 == #race[list_add_~list#1.base,5 + list_add_~list#1.offset]) && 0 == #race[list_add_~list#1.base,6 + list_add_~list#1.offset]) && 0 == #race[list_add_~list#1.base,7 + list_add_~list#1.offset]);
[2025-02-08 05:32:43,127 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-2: list_add_~temp~0#1.base, list_add_~temp~0#1.offset := list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset;
[2025-02-08 05:32:43,127 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-3: #race := #race[list_add_~list#1.base,7 + list_add_~list#1.offset := 0];
[2025-02-08 05:32:43,127 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-4: #race := #race[list_add_~list#1.base,6 + list_add_~list#1.offset := 0];
[2025-02-08 05:32:43,127 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-5: #race := #race[list_add_~list#1.base,5 + list_add_~list#1.offset := 0];
[2025-02-08 05:32:43,127 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-6: #race := #race[list_add_~list#1.base,4 + list_add_~list#1.offset := 0];
[2025-02-08 05:32:43,127 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-7: SUMMARY for call list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset := read~$Pointer$(list_add_~list#1.base, 4 + list_add_~list#1.offset, 4); srcloc: null
[2025-02-08 05:32:43,127 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1235: assume ((#race[list_add_~list#1.base,4 + list_add_~list#1.offset] == list_add_#t~nondet34#1 && #race[list_add_~list#1.base,5 + list_add_~list#1.offset] == list_add_#t~nondet34#1) && #race[list_add_~list#1.base,6 + list_add_~list#1.offset] == list_add_#t~nondet34#1) && #race[list_add_~list#1.base,7 + list_add_~list#1.offset] == list_add_#t~nondet34#1;
[2025-02-08 05:32:43,127 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1235: assume !(((#race[list_add_~list#1.base,4 + list_add_~list#1.offset] == list_add_#t~nondet34#1 && #race[list_add_~list#1.base,5 + list_add_~list#1.offset] == list_add_#t~nondet34#1) && #race[list_add_~list#1.base,6 + list_add_~list#1.offset] == list_add_#t~nondet34#1) && #race[list_add_~list#1.base,7 + list_add_~list#1.offset] == list_add_#t~nondet34#1);
[2025-02-08 05:32:43,127 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-1: havoc list_add_#t~nondet34#1;
[2025-02-08 05:32:43,127 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-2: #race := #race[list_add_~list#1.base,7 + list_add_~list#1.offset := list_add_#t~nondet34#1];
[2025-02-08 05:32:43,127 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-3: #race := #race[list_add_~list#1.base,6 + list_add_~list#1.offset := list_add_#t~nondet34#1];
[2025-02-08 05:32:43,127 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-4: #race := #race[list_add_~list#1.base,5 + list_add_~list#1.offset := list_add_#t~nondet34#1];
[2025-02-08 05:32:43,128 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-5: #race := #race[list_add_~list#1.base,4 + list_add_~list#1.offset := list_add_#t~nondet34#1];
[2025-02-08 05:32:43,128 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-6: havoc list_add_#t~nondet34#1;
[2025-02-08 05:32:43,128 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-7: SUMMARY for call write~$Pointer$(list_add_~node#1.base, list_add_~node#1.offset, list_add_~list#1.base, 4 + list_add_~list#1.offset, 4); srcloc: null
[2025-02-08 05:32:43,128 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1244: havoc #t~mem38#1.base, #t~mem38#1.offset;
[2025-02-08 05:32:43,128 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-1: assume { :end_inline_list_add } true;havoc #t~ret37#1.base, #t~ret37#1.offset;
[2025-02-08 05:32:43,128 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-2: havoc list_add_#in~node#1.base, list_add_#in~node#1.offset, list_add_#in~list#1.base, list_add_#in~list#1.offset;
[2025-02-08 05:32:43,128 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-3: havoc list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset, list_add_#t~nondet34#1, list_add_#t~nondet35#1, list_add_~node#1.base, list_add_~node#1.offset, list_add_~list#1.base, list_add_~list#1.offset, list_add_~temp~0#1.base, list_add_~temp~0#1.offset;
[2025-02-08 05:32:43,128 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-4: havoc list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset, list_add_#t~nondet34#1, list_add_#t~nondet35#1, list_add_~node#1.base, list_add_~node#1.offset, list_add_~list#1.base, list_add_~list#1.offset, list_add_~temp~0#1.base, list_add_~temp~0#1.offset;
[2025-02-08 05:32:43,129 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-5: assume ((0 == #race[~#slot~0.base,~#slot~0.offset + 4 * ~i~0#1] && 0 == #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * ~i~0#1)]) && 0 == #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * ~i~0#1)]) && 0 == #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * ~i~0#1)];
[2025-02-08 05:32:43,129 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-5: assume !(((0 == #race[~#slot~0.base,~#slot~0.offset + 4 * ~i~0#1] && 0 == #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * ~i~0#1)]) && 0 == #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * ~i~0#1)]) && 0 == #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * ~i~0#1)]);
[2025-02-08 05:32:43,129 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-6: assume { :begin_inline_list_add } true;list_add_#in~node#1.base, list_add_#in~node#1.offset, list_add_#in~list#1.base, list_add_#in~list#1.offset := #t~ret37#1.base, #t~ret37#1.offset, #t~mem38#1.base, #t~mem38#1.offset;
[2025-02-08 05:32:43,129 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-7: #race := #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * ~i~0#1) := 0];
[2025-02-08 05:32:43,129 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1236: assume ((#race[list_add_~node#1.base,4 + list_add_~node#1.offset] == list_add_#t~nondet35#1 && #race[list_add_~node#1.base,5 + list_add_~node#1.offset] == list_add_#t~nondet35#1) && #race[list_add_~node#1.base,6 + list_add_~node#1.offset] == list_add_#t~nondet35#1) && #race[list_add_~node#1.base,7 + list_add_~node#1.offset] == list_add_#t~nondet35#1;
[2025-02-08 05:32:43,129 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1236: assume !(((#race[list_add_~node#1.base,4 + list_add_~node#1.offset] == list_add_#t~nondet35#1 && #race[list_add_~node#1.base,5 + list_add_~node#1.offset] == list_add_#t~nondet35#1) && #race[list_add_~node#1.base,6 + list_add_~node#1.offset] == list_add_#t~nondet35#1) && #race[list_add_~node#1.base,7 + list_add_~node#1.offset] == list_add_#t~nondet35#1);
[2025-02-08 05:32:43,129 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-8: #race := #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * ~i~0#1) := 0];
[2025-02-08 05:32:43,130 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-1: havoc list_add_#t~nondet35#1;
[2025-02-08 05:32:43,131 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-9: #race := #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * ~i~0#1) := 0];
[2025-02-08 05:32:43,131 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-2: #race := #race[list_add_~node#1.base,7 + list_add_~node#1.offset := list_add_#t~nondet35#1];
[2025-02-08 05:32:43,131 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-10: #race := #race[~#slot~0.base,~#slot~0.offset + 4 * ~i~0#1 := 0];
[2025-02-08 05:32:43,131 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-3: #race := #race[list_add_~node#1.base,6 + list_add_~node#1.offset := list_add_#t~nondet35#1];
[2025-02-08 05:32:43,131 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-11: SUMMARY for call #t~mem38#1.base, #t~mem38#1.offset := read~$Pointer$(~#slot~0.base, ~#slot~0.offset + 4 * ~i~0#1, 4); srcloc: null
[2025-02-08 05:32:43,131 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-4: #race := #race[list_add_~node#1.base,5 + list_add_~node#1.offset := list_add_#t~nondet35#1];
[2025-02-08 05:32:43,132 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-12: havoc new_#in~x#1;assume { :end_inline_new } true;
[2025-02-08 05:32:43,132 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-5: #race := #race[list_add_~node#1.base,4 + list_add_~node#1.offset := list_add_#t~nondet35#1];
[2025-02-08 05:32:43,132 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-13: havoc new_#t~malloc30#1.base, new_#t~malloc30#1.offset, new_#t~nondet31#1, new_#t~nondet32#1, new_~x#1, new_~p~0#1.base, new_~p~0#1.offset;
[2025-02-08 05:32:43,132 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-6: havoc list_add_#t~nondet35#1;
[2025-02-08 05:32:43,132 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1244-14: #t~ret37#1.base, #t~ret37#1.offset := new_#res#1.base, new_#res#1.offset;
[2025-02-08 05:32:43,132 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-7: SUMMARY for call write~$Pointer$(list_add_~temp~0#1.base, list_add_~temp~0#1.offset, list_add_~node#1.base, 4 + list_add_~node#1.offset, 4); srcloc: null
[2025-02-08 05:32:43,133 INFO  L304             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-02-08 05:32:43,133 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-08 05:32:43,151 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-08 05:32:43,151 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-08 05:32:43,152 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:43 BoogieIcfgContainer
[2025-02-08 05:32:43,152 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-08 05:32:43,153 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-08 05:32:43,154 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-08 05:32:43,157 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-08 05:32:43,157 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:32:41" (1/3) ...
[2025-02-08 05:32:43,157 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1baf6763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:43, skipping insertion in model container
[2025-02-08 05:32:43,157 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (2/3) ...
[2025-02-08 05:32:43,158 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1baf6763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:43, skipping insertion in model container
[2025-02-08 05:32:43,158 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:43" (3/3) ...
[2025-02-08 05:32:43,158 INFO  L128   eAbstractionObserver]: Analyzing ICFG 09-regions_17-arrayloop_nr.i
[2025-02-08 05:32:43,169 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-08 05:32:43,170 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_17-arrayloop_nr.i that has 2 procedures, 179 locations, 1 initial locations, 3 loop locations, and 18 error locations.
[2025-02-08 05:32:43,171 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-02-08 05:32:43,216 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2025-02-08 05:32:43,245 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 182 places, 178 transitions, 360 flow
[2025-02-08 05:32:43,303 INFO  L124   PetriNetUnfolderBase]: 0/177 cut-off events.
[2025-02-08 05:32:43,309 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-02-08 05:32:43,312 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 181 conditions, 177 events. 0/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 231 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2025-02-08 05:32:43,312 INFO  L82        GeneralOperation]: Start removeDead. Operand has 182 places, 178 transitions, 360 flow
[2025-02-08 05:32:43,315 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 178 places, 174 transitions, 351 flow
[2025-02-08 05:32:43,321 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-08 05:32:43,328 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;@4c900f13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-08 05:32:43,329 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2025-02-08 05:32:43,359 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-02-08 05:32:43,360 INFO  L124   PetriNetUnfolderBase]: 0/121 cut-off events.
[2025-02-08 05:32:43,360 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-02-08 05:32:43,361 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:32:43,361 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]
[2025-02-08 05:32:43,362 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2025-02-08 05:32:43,365 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:32:43,366 INFO  L85        PathProgramCache]: Analyzing trace with hash -814498411, now seen corresponding path program 1 times
[2025-02-08 05:32:43,370 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:32:43,371 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619746091]
[2025-02-08 05:32:43,371 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:32:43,373 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:32:43,449 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes.
[2025-02-08 05:32:43,508 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements.
[2025-02-08 05:32:43,508 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:32:43,509 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:32:44,201 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-08 05:32:44,202 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:32:44,202 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619746091]
[2025-02-08 05:32:44,203 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619746091] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:32:44,203 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:32:44,203 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-08 05:32:44,204 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770664891]
[2025-02-08 05:32:44,205 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:32:44,210 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-08 05:32:44,214 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:32:44,231 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-08 05:32:44,232 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-08 05:32:44,473 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 147 out of 178
[2025-02-08 05:32:44,477 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 174 transitions, 351 flow. Second operand  has 6 states, 6 states have (on average 148.33333333333334) internal successors, (890), 6 states have internal predecessors, (890), 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-08 05:32:44,478 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:32:44,478 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 178
[2025-02-08 05:32:44,483 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:32:44,681 INFO  L124   PetriNetUnfolderBase]: 132/592 cut-off events.
[2025-02-08 05:32:44,682 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2025-02-08 05:32:44,686 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 896 conditions, 592 events. 132/592 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2615 event pairs, 45 based on Foata normal form. 0/553 useless extension candidates. Maximal degree in co-relation 780. Up to 232 conditions per place. 
[2025-02-08 05:32:44,689 INFO  L140   encePairwiseOnDemand]: 157/178 looper letters, 28 selfloop transitions, 43 changer transitions 0/214 dead transitions.
[2025-02-08 05:32:44,690 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 214 transitions, 573 flow
[2025-02-08 05:32:44,691 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-08 05:32:44,693 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-08 05:32:44,701 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 955 transitions.
[2025-02-08 05:32:44,705 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8941947565543071
[2025-02-08 05:32:44,706 INFO  L175             Difference]: Start difference. First operand has 178 places, 174 transitions, 351 flow. Second operand 6 states and 955 transitions.
[2025-02-08 05:32:44,707 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 214 transitions, 573 flow
[2025-02-08 05:32:44,710 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 214 transitions, 572 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-02-08 05:32:44,715 INFO  L231             Difference]: Finished difference. Result has 186 places, 210 transitions, 622 flow
[2025-02-08 05:32:44,717 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=622, PETRI_PLACES=186, PETRI_TRANSITIONS=210}
[2025-02-08 05:32:44,720 INFO  L279   CegarLoopForPetriNet]: 178 programPoint places, 8 predicate places.
[2025-02-08 05:32:44,720 INFO  L471      AbstractCegarLoop]: Abstraction has has 186 places, 210 transitions, 622 flow
[2025-02-08 05:32:44,721 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 148.33333333333334) internal successors, (890), 6 states have internal predecessors, (890), 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-08 05:32:44,721 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:32:44,721 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]
[2025-02-08 05:32:44,721 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-08 05:32:44,721 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2025-02-08 05:32:44,722 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:32:44,723 INFO  L85        PathProgramCache]: Analyzing trace with hash -2138428964, now seen corresponding path program 1 times
[2025-02-08 05:32:44,723 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:32:44,723 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325522558]
[2025-02-08 05:32:44,723 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:32:44,723 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:32:44,744 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes.
[2025-02-08 05:32:44,755 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements.
[2025-02-08 05:32:44,755 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:32:44,756 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:32:45,138 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-08 05:32:45,139 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:32:45,139 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325522558]
[2025-02-08 05:32:45,139 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325522558] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:32:45,140 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:32:45,140 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-08 05:32:45,140 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142449147]
[2025-02-08 05:32:45,140 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:32:45,141 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-08 05:32:45,142 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:32:45,142 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-08 05:32:45,143 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-08 05:32:45,321 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 147 out of 178
[2025-02-08 05:32:45,322 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 210 transitions, 622 flow. Second operand  has 6 states, 6 states have (on average 148.33333333333334) internal successors, (890), 6 states have internal predecessors, (890), 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-08 05:32:45,322 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:32:45,322 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 178
[2025-02-08 05:32:45,323 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:32:45,527 INFO  L124   PetriNetUnfolderBase]: 215/805 cut-off events.
[2025-02-08 05:32:45,527 INFO  L125   PetriNetUnfolderBase]: For 197/200 co-relation queries the response was YES.
[2025-02-08 05:32:45,528 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1612 conditions, 805 events. 215/805 cut-off events. For 197/200 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3893 event pairs, 53 based on Foata normal form. 1/755 useless extension candidates. Maximal degree in co-relation 1485. Up to 314 conditions per place. 
[2025-02-08 05:32:45,531 INFO  L140   encePairwiseOnDemand]: 158/178 looper letters, 56 selfloop transitions, 38 changer transitions 26/250 dead transitions.
[2025-02-08 05:32:45,531 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 250 transitions, 968 flow
[2025-02-08 05:32:45,532 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-08 05:32:45,532 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-08 05:32:45,533 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 953 transitions.
[2025-02-08 05:32:45,533 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8923220973782772
[2025-02-08 05:32:45,533 INFO  L175             Difference]: Start difference. First operand has 186 places, 210 transitions, 622 flow. Second operand 6 states and 953 transitions.
[2025-02-08 05:32:45,533 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 250 transitions, 968 flow
[2025-02-08 05:32:45,536 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 250 transitions, 968 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-02-08 05:32:45,539 INFO  L231             Difference]: Finished difference. Result has 195 places, 220 transitions, 866 flow
[2025-02-08 05:32:45,539 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=866, PETRI_PLACES=195, PETRI_TRANSITIONS=220}
[2025-02-08 05:32:45,540 INFO  L279   CegarLoopForPetriNet]: 178 programPoint places, 17 predicate places.
[2025-02-08 05:32:45,540 INFO  L471      AbstractCegarLoop]: Abstraction has has 195 places, 220 transitions, 866 flow
[2025-02-08 05:32:45,541 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 148.33333333333334) internal successors, (890), 6 states have internal predecessors, (890), 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-08 05:32:45,541 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:32:45,541 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]
[2025-02-08 05:32:45,541 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-08 05:32:45,541 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2025-02-08 05:32:45,542 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:32:45,542 INFO  L85        PathProgramCache]: Analyzing trace with hash 1023928118, now seen corresponding path program 1 times
[2025-02-08 05:32:45,542 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:32:45,542 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709731659]
[2025-02-08 05:32:45,542 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:32:45,542 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:32:45,552 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes.
[2025-02-08 05:32:45,557 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements.
[2025-02-08 05:32:45,557 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:32:45,557 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:32:45,605 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-08 05:32:45,605 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:32:45,605 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709731659]
[2025-02-08 05:32:45,605 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709731659] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:32:45,605 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:32:45,605 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 05:32:45,605 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085052737]
[2025-02-08 05:32:45,606 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:32:45,606 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 05:32:45,606 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:32:45,608 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 05:32:45,608 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 05:32:45,622 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 178
[2025-02-08 05:32:45,623 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 220 transitions, 866 flow. Second operand  has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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-08 05:32:45,623 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:32:45,623 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 178
[2025-02-08 05:32:45,623 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:32:45,627 INFO  L124   PetriNetUnfolderBase]: 0/72 cut-off events.
[2025-02-08 05:32:45,628 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-02-08 05:32:45,628 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 87 conditions, 72 events. 0/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 1/73 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. 
[2025-02-08 05:32:45,628 INFO  L140   encePairwiseOnDemand]: 176/178 looper letters, 0 selfloop transitions, 0 changer transitions 72/72 dead transitions.
[2025-02-08 05:32:45,628 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 72 transitions, 150 flow
[2025-02-08 05:32:45,629 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 05:32:45,629 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-08 05:32:45,629 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions.
[2025-02-08 05:32:45,631 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.951310861423221
[2025-02-08 05:32:45,631 INFO  L175             Difference]: Start difference. First operand has 195 places, 220 transitions, 866 flow. Second operand 3 states and 508 transitions.
[2025-02-08 05:32:45,631 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 72 transitions, 150 flow
[2025-02-08 05:32:45,631 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 72 transitions, 150 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-02-08 05:32:45,633 INFO  L231             Difference]: Finished difference. Result has 85 places, 0 transitions, 0 flow
[2025-02-08 05:32:45,633 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=85, PETRI_TRANSITIONS=0}
[2025-02-08 05:32:45,633 INFO  L279   CegarLoopForPetriNet]: 178 programPoint places, -93 predicate places.
[2025-02-08 05:32:45,633 INFO  L471      AbstractCegarLoop]: Abstraction has has 85 places, 0 transitions, 0 flow
[2025-02-08 05:32:45,634 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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-08 05:32:45,636 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining)
[2025-02-08 05:32:45,637 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2025-02-08 05:32:45,637 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2025-02-08 05:32:45,637 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2025-02-08 05:32:45,637 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining)
[2025-02-08 05:32:45,637 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2025-02-08 05:32:45,637 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2025-02-08 05:32:45,637 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2025-02-08 05:32:45,637 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2025-02-08 05:32:45,637 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-08 05:32:45,638 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2025-02-08 05:32:45,642 INFO  L241   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2025-02-08 05:32:45,642 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-08 05:32:45,646 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:32:45 BasicIcfg
[2025-02-08 05:32:45,646 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-08 05:32:45,647 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-08 05:32:45,647 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-08 05:32:45,647 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-08 05:32:45,648 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:43" (3/4) ...
[2025-02-08 05:32:45,649 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-02-08 05:32:45,650 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun
[2025-02-08 05:32:45,654 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges
[2025-02-08 05:32:45,654 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-02-08 05:32:45,654 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-02-08 05:32:45,716 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-08 05:32:45,717 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-02-08 05:32:45,717 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-08 05:32:45,718 INFO  L158              Benchmark]: Toolchain (without parser) took 4272.44ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 109.7MB in the beginning and 173.3MB in the end (delta: -63.6MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB.
[2025-02-08 05:32:45,718 INFO  L158              Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 05:32:45,719 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 870.03ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 69.3MB in the end (delta: 40.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
[2025-02-08 05:32:45,719 INFO  L158              Benchmark]: Boogie Procedure Inliner took 40.57ms. Allocated memory is still 142.6MB. Free memory was 69.3MB in the beginning and 65.1MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-08 05:32:45,720 INFO  L158              Benchmark]: Boogie Preprocessor took 32.62ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 61.6MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 05:32:45,720 INFO  L158              Benchmark]: IcfgBuilder took 757.36ms. Allocated memory is still 142.6MB. Free memory was 61.6MB in the beginning and 90.9MB in the end (delta: -29.3MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB.
[2025-02-08 05:32:45,721 INFO  L158              Benchmark]: TraceAbstraction took 2493.24ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 90.2MB in the beginning and 178.7MB in the end (delta: -88.5MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB.
[2025-02-08 05:32:45,721 INFO  L158              Benchmark]: Witness Printer took 70.20ms. Allocated memory is still 285.2MB. Free memory was 178.7MB in the beginning and 173.3MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 05:32:45,723 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 870.03ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 69.3MB in the end (delta: 40.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 40.57ms. Allocated memory is still 142.6MB. Free memory was 69.3MB in the beginning and 65.1MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 32.62ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 61.6MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 757.36ms. Allocated memory is still 142.6MB. Free memory was 61.6MB in the beginning and 90.9MB in the end (delta: -29.3MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB.
 * TraceAbstraction took 2493.24ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 90.2MB in the beginning and 178.7MB in the end (delta: -88.5MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB.
 * Witness Printer took 70.20ms. Allocated memory is still 285.2MB. Free memory was 178.7MB in the beginning and 173.3MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 1229]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 1230]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 1229]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 1230]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 1229]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 1230]: there are no data races
    For all program executions holds that there are no data races at this location
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 216 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 135 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 617 IncrementalHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 14 mSDtfsCounter, 617 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=866occurred in iteration=2, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 450 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    18 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-02-08 05:32:45,739 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE