./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.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_09-arraylist.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 bbb47797d2c6a4d5e961c4dfd7a8e6f4ff79c632e04c289068b1b9e8cca736fa --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:32:19,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:32:19,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:19,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:32:19,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:32:19,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:32:19,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:32:19,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:32:19,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:32:19,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:32:19,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:32:19,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:32:19,478 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:32:19,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:32:19,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:32:19,478 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:32:19,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:32:19,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:32:19,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:32:19,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:32:19,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:32:19,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:32:19,478 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:32:19,478 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:32:19,479 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:32:19,479 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:32:19,479 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:32:19,479 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:32:19,479 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:32:19,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:32:19,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:32:19,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:32:19,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:32:19,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:32:19,480 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:32:19,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:32:19,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:32:19,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:32:19,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:32:19,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:32:19,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:32:19,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:32:19,480 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 -> bbb47797d2c6a4d5e961c4dfd7a8e6f4ff79c632e04c289068b1b9e8cca736fa [2025-02-08 05:32:19,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:32:19,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:32:19,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:32:19,692 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:32:19,693 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:32:19,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i [2025-02-08 05:32:20,819 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ae4ad5ed/b9f12f5fbd87411abd592701f759d258/FLAG9fb9d54c6 [2025-02-08 05:32:21,222 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:32:21,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i [2025-02-08 05:32:21,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ae4ad5ed/b9f12f5fbd87411abd592701f759d258/FLAG9fb9d54c6 [2025-02-08 05:32:21,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ae4ad5ed/b9f12f5fbd87411abd592701f759d258 [2025-02-08 05:32:21,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:32:21,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:32:21,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:32:21,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:32:21,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:32:21,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:32:21" (1/1) ... [2025-02-08 05:32:21,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d17310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:21, skipping insertion in model container [2025-02-08 05:32:21,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:32:21" (1/1) ... [2025-02-08 05:32:21,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:32:21,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:32:21,876 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:32:21,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:32:21,990 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:32:21,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:21 WrapperNode [2025-02-08 05:32:21,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:32:21,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:32:21,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:32:21,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:32:21,996 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:21" (1/1) ... [2025-02-08 05:32:22,014 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:21" (1/1) ... [2025-02-08 05:32:22,056 INFO L138 Inliner]: procedures = 372, calls = 43, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 242 [2025-02-08 05:32:22,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:32:22,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:32:22,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:32:22,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:32:22,062 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:21" (1/1) ... [2025-02-08 05:32:22,063 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:21" (1/1) ... [2025-02-08 05:32:22,071 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:21" (1/1) ... [2025-02-08 05:32:22,071 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:21" (1/1) ... [2025-02-08 05:32:22,088 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:21" (1/1) ... [2025-02-08 05:32:22,090 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:21" (1/1) ... [2025-02-08 05:32:22,091 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:21" (1/1) ... [2025-02-08 05:32:22,092 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:21" (1/1) ... [2025-02-08 05:32:22,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:32:22,095 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:32:22,095 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:32:22,095 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:32:22,100 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:21" (1/1) ... [2025-02-08 05:32:22,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:32:22,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:22,140 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:22,143 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:22,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 05:32:22,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 05:32:22,159 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:32:22,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:32:22,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:32:22,159 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:32:22,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:32:22,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:32:22,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 05:32:22,160 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:32:22,160 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:32:22,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:32:22,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:32:22,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:32:22,161 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:22,278 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:32:22,281 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:32:22,650 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241: 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:22,650 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241: 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:22,650 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-1: havoc list_add_#t~nondet35#1; [2025-02-08 05:32:22,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-2: #race := #race[list_add_~node#1.base,7 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:22,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-3: #race := #race[list_add_~node#1.base,6 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:22,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-4: #race := #race[list_add_~node#1.base,5 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:22,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-5: #race := #race[list_add_~node#1.base,4 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:22,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-6: havoc list_add_#t~nondet35#1; [2025-02-08 05:32:22,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-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:22,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1258-1: havoc main_#t~post46#1; [2025-02-08 05:32:22,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1258-2: main_~k~0#1 := 1 + main_#t~post46#1; [2025-02-08 05:32:22,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1258-3: main_#t~post46#1 := main_~k~0#1; [2025-02-08 05:32:22,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1259: havoc main_#t~nondet43#1; [2025-02-08 05:32:22,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1259-1: assume ((#race[~#slot~0.base,~#slot~0.offset + 4 * main_~k~0#1] == main_#t~nondet43#1 && #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~k~0#1)] == main_#t~nondet43#1) && #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~k~0#1)] == main_#t~nondet43#1) && #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~k~0#1)] == main_#t~nondet43#1; [2025-02-08 05:32:22,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1259-1: assume !(((#race[~#slot~0.base,~#slot~0.offset + 4 * main_~k~0#1] == main_#t~nondet43#1 && #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~k~0#1)] == main_#t~nondet43#1) && #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~k~0#1)] == main_#t~nondet43#1) && #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~k~0#1)] == main_#t~nondet43#1); [2025-02-08 05:32:22,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1259-2: havoc main_#t~ret42#1.base, main_#t~ret42#1.offset; [2025-02-08 05:32:22,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1259-3: #race := #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~k~0#1) := main_#t~nondet43#1]; [2025-02-08 05:32:22,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1259-4: #race := #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~k~0#1) := main_#t~nondet43#1]; [2025-02-08 05:32:22,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1259-5: #race := #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~k~0#1) := main_#t~nondet43#1]; [2025-02-08 05:32:22,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1259-6: #race := #race[~#slot~0.base,~#slot~0.offset + 4 * main_~k~0#1 := main_#t~nondet43#1]; [2025-02-08 05:32:22,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1259-7: havoc main_#t~nondet43#1; [2025-02-08 05:32:22,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1259-8: SUMMARY for call write~$Pointer$(main_#t~ret42#1.base, main_#t~ret42#1.offset, ~#slot~0.base, ~#slot~0.offset + 4 * main_~k~0#1, 4); srcloc: null [2025-02-08 05:32:22,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1259-9: havoc new_#in~x#1;assume { :end_inline_new } true; [2025-02-08 05:32:22,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1259-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:22,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1259-11: main_#t~ret42#1.base, main_#t~ret42#1.offset := new_#res#1.base, new_#res#1.offset; [2025-02-08 05:32:22,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260: havoc main_#t~mem45#1.base, main_#t~mem45#1.offset; [2025-02-08 05:32:22,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-1: assume { :end_inline_list_add } true;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset; [2025-02-08 05:32:22,652 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:22,652 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:22,652 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:22,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-5: assume ((0 == #race[~#slot~0.base,~#slot~0.offset + 4 * main_~k~0#1] && 0 == #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~k~0#1)]) && 0 == #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~k~0#1)]) && 0 == #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~k~0#1)]; [2025-02-08 05:32:22,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-5: assume !(((0 == #race[~#slot~0.base,~#slot~0.offset + 4 * main_~k~0#1] && 0 == #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~k~0#1)]) && 0 == #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~k~0#1)]) && 0 == #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~k~0#1)]); [2025-02-08 05:32:22,652 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~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1.base, main_#t~mem45#1.offset; [2025-02-08 05:32:22,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-7: #race := #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~k~0#1) := 0]; [2025-02-08 05:32:22,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-8: #race := #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~k~0#1) := 0]; [2025-02-08 05:32:22,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-9: #race := #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~k~0#1) := 0]; [2025-02-08 05:32:22,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-10: #race := #race[~#slot~0.base,~#slot~0.offset + 4 * main_~k~0#1 := 0]; [2025-02-08 05:32:22,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-11: SUMMARY for call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(~#slot~0.base, ~#slot~0.offset + 4 * main_~k~0#1, 4); srcloc: null [2025-02-08 05:32:22,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-12: havoc new_#in~x#1;assume { :end_inline_new } true; [2025-02-08 05:32:22,652 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:22,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-14: main_#t~ret44#1.base, main_#t~ret44#1.offset := new_#res#1.base, new_#res#1.offset; [2025-02-08 05:32:22,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-15: 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:22,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-16: havoc new_#res#1.base, new_#res#1.offset; [2025-02-08 05:32:22,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-17: assume { :begin_inline_new } true;new_#in~x#1 := 2; [2025-02-08 05:32:22,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1232: new_~x#1 := new_#in~x#1; [2025-02-08 05:32:22,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1233: havoc new_#t~malloc30#1.base, new_#t~malloc30#1.offset; [2025-02-08 05:32:22,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1233-1: new_~p~0#1.base, new_~p~0#1.offset := new_#t~malloc30#1.base, new_#t~malloc30#1.offset; [2025-02-08 05:32:22,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1233-2: SUMMARY for call new_#t~malloc30#1.base, new_#t~malloc30#1.offset := #Ultimate.allocOnHeap(8); srcloc: null [2025-02-08 05:32:22,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234: assume ((#race[new_~p~0#1.base,new_~p~0#1.offset] == new_#t~nondet31#1 && #race[new_~p~0#1.base,1 + new_~p~0#1.offset] == new_#t~nondet31#1) && #race[new_~p~0#1.base,2 + new_~p~0#1.offset] == new_#t~nondet31#1) && #race[new_~p~0#1.base,3 + new_~p~0#1.offset] == new_#t~nondet31#1; [2025-02-08 05:32:22,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234: assume !(((#race[new_~p~0#1.base,new_~p~0#1.offset] == new_#t~nondet31#1 && #race[new_~p~0#1.base,1 + new_~p~0#1.offset] == new_#t~nondet31#1) && #race[new_~p~0#1.base,2 + new_~p~0#1.offset] == new_#t~nondet31#1) && #race[new_~p~0#1.base,3 + new_~p~0#1.offset] == new_#t~nondet31#1); [2025-02-08 05:32:22,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-1: havoc new_#t~nondet31#1; [2025-02-08 05:32:22,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-2: #race := #race[new_~p~0#1.base,3 + new_~p~0#1.offset := new_#t~nondet31#1]; [2025-02-08 05:32:22,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-3: #race := #race[new_~p~0#1.base,2 + new_~p~0#1.offset := new_#t~nondet31#1]; [2025-02-08 05:32:22,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-4: #race := #race[new_~p~0#1.base,1 + new_~p~0#1.offset := new_#t~nondet31#1]; [2025-02-08 05:32:22,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-5: #race := #race[new_~p~0#1.base,new_~p~0#1.offset := new_#t~nondet31#1]; [2025-02-08 05:32:22,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-6: havoc new_#t~nondet31#1; [2025-02-08 05:32:22,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-7: SUMMARY for call write~int(new_~x#1, new_~p~0#1.base, new_~p~0#1.offset, 4); srcloc: null [2025-02-08 05:32:22,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235: assume ((#race[new_~p~0#1.base,4 + new_~p~0#1.offset] == new_#t~nondet32#1 && #race[new_~p~0#1.base,5 + new_~p~0#1.offset] == new_#t~nondet32#1) && #race[new_~p~0#1.base,6 + new_~p~0#1.offset] == new_#t~nondet32#1) && #race[new_~p~0#1.base,7 + new_~p~0#1.offset] == new_#t~nondet32#1; [2025-02-08 05:32:22,655 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235: assume !(((#race[new_~p~0#1.base,4 + new_~p~0#1.offset] == new_#t~nondet32#1 && #race[new_~p~0#1.base,5 + new_~p~0#1.offset] == new_#t~nondet32#1) && #race[new_~p~0#1.base,6 + new_~p~0#1.offset] == new_#t~nondet32#1) && #race[new_~p~0#1.base,7 + new_~p~0#1.offset] == new_#t~nondet32#1); [2025-02-08 05:32:22,655 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-1: havoc new_#t~nondet32#1; [2025-02-08 05:32:22,655 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-2: #race := #race[new_~p~0#1.base,7 + new_~p~0#1.offset := new_#t~nondet32#1]; [2025-02-08 05:32:22,655 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-3: #race := #race[new_~p~0#1.base,6 + new_~p~0#1.offset := new_#t~nondet32#1]; [2025-02-08 05:32:22,655 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-4: #race := #race[new_~p~0#1.base,5 + new_~p~0#1.offset := new_#t~nondet32#1]; [2025-02-08 05:32:22,655 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-5: #race := #race[new_~p~0#1.base,4 + new_~p~0#1.offset := new_#t~nondet32#1]; [2025-02-08 05:32:22,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-6: havoc new_#t~nondet32#1; [2025-02-08 05:32:22,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-7: SUMMARY for call write~$Pointer$(0, 0, new_~p~0#1.base, 4 + new_~p~0#1.offset, 4); srcloc: null [2025-02-08 05:32:22,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-1: new_#res#1.base, new_#res#1.offset := new_~p~0#1.base, new_~p~0#1.offset; [2025-02-08 05:32:22,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238: 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:22,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238-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:22,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239: havoc list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset; [2025-02-08 05:32:22,659 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-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:22,659 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-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:22,659 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-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:22,659 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-3: #race := #race[list_add_~list#1.base,7 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:22,659 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-4: #race := #race[list_add_~list#1.base,6 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:22,659 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-5: #race := #race[list_add_~list#1.base,5 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:22,659 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-6: #race := #race[list_add_~list#1.base,4 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:22,660 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-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:22,660 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240: 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:22,660 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240: 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:22,660 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-1: havoc list_add_#t~nondet34#1; [2025-02-08 05:32:22,660 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-2: #race := #race[list_add_~list#1.base,7 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:22,660 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-3: #race := #race[list_add_~list#1.base,6 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:22,660 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-4: #race := #race[list_add_~list#1.base,5 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:22,660 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-5: #race := #race[list_add_~list#1.base,4 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:22,660 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-6: havoc list_add_#t~nondet34#1; [2025-02-08 05:32:22,660 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-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:22,789 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:32:22,790 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:32:22,819 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:32:22,819 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:32:22,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:22 BoogieIcfgContainer [2025-02-08 05:32:22,820 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:32:22,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:32:22,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:32:22,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:32:22,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:32:21" (1/3) ... [2025-02-08 05:32:22,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc1030a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:22, skipping insertion in model container [2025-02-08 05:32:22,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:21" (2/3) ... [2025-02-08 05:32:22,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc1030a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:22, skipping insertion in model container [2025-02-08 05:32:22,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:22" (3/3) ... [2025-02-08 05:32:22,832 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_09-arraylist.i [2025-02-08 05:32:22,843 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:32:22,845 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_09-arraylist.i that has 2 procedures, 198 locations, 1 initial locations, 1 loop locations, and 18 error locations. [2025-02-08 05:32:22,845 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:32:22,955 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:32:22,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 199 transitions, 402 flow [2025-02-08 05:32:23,055 INFO L124 PetriNetUnfolderBase]: 2/198 cut-off events. [2025-02-08 05:32:23,057 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:23,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 198 events. 2/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 210 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2025-02-08 05:32:23,063 INFO L82 GeneralOperation]: Start removeDead. Operand has 201 places, 199 transitions, 402 flow [2025-02-08 05:32:23,070 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 195 transitions, 393 flow [2025-02-08 05:32:23,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:32:23,091 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;@40f466f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:32:23,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-02-08 05:32:23,103 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:32:23,103 INFO L124 PetriNetUnfolderBase]: 1/75 cut-off events. [2025-02-08 05:32:23,103 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:23,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:23,104 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] [2025-02-08 05:32:23,104 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:32:23,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:23,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1786244629, now seen corresponding path program 1 times [2025-02-08 05:32:23,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:23,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582245770] [2025-02-08 05:32:23,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:23,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:23,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 05:32:23,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 05:32:23,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:23,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:23,785 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:23,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:23,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582245770] [2025-02-08 05:32:23,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582245770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:23,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:23,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:23,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329774930] [2025-02-08 05:32:23,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:23,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:23,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:23,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:23,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:24,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 199 [2025-02-08 05:32:24,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 195 transitions, 393 flow. Second operand has 6 states, 6 states have (on average 147.33333333333334) internal successors, (884), 6 states have internal predecessors, (884), 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:24,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:24,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 199 [2025-02-08 05:32:24,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:24,336 INFO L124 PetriNetUnfolderBase]: 364/1545 cut-off events. [2025-02-08 05:32:24,336 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:32:24,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2328 conditions, 1545 events. 364/1545 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9260 event pairs, 364 based on Foata normal form. 11/1436 useless extension candidates. Maximal degree in co-relation 2247. Up to 774 conditions per place. [2025-02-08 05:32:24,345 INFO L140 encePairwiseOnDemand]: 191/199 looper letters, 45 selfloop transitions, 5 changer transitions 1/192 dead transitions. [2025-02-08 05:32:24,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 192 transitions, 487 flow [2025-02-08 05:32:24,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:24,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 929 transitions. [2025-02-08 05:32:24,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7780569514237856 [2025-02-08 05:32:24,357 INFO L175 Difference]: Start difference. First operand has 197 places, 195 transitions, 393 flow. Second operand 6 states and 929 transitions. [2025-02-08 05:32:24,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 192 transitions, 487 flow [2025-02-08 05:32:24,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 192 transitions, 486 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:24,364 INFO L231 Difference]: Finished difference. Result has 200 places, 191 transitions, 394 flow [2025-02-08 05:32:24,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=200, PETRI_TRANSITIONS=191} [2025-02-08 05:32:24,368 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, 3 predicate places. [2025-02-08 05:32:24,368 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 191 transitions, 394 flow [2025-02-08 05:32:24,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.33333333333334) internal successors, (884), 6 states have internal predecessors, (884), 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:24,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:24,369 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] [2025-02-08 05:32:24,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:32:24,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:32:24,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:24,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1957042332, now seen corresponding path program 1 times [2025-02-08 05:32:24,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:24,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794169109] [2025-02-08 05:32:24,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:24,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:24,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:32:24,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:32:24,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:24,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:24,420 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:24,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:24,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794169109] [2025-02-08 05:32:24,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794169109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:24,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:24,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:32:24,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707020946] [2025-02-08 05:32:24,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:24,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:32:24,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:24,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:32:24,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:32:24,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 199 [2025-02-08 05:32:24,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 191 transitions, 394 flow. Second operand has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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:24,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:24,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 199 [2025-02-08 05:32:24,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:24,435 INFO L124 PetriNetUnfolderBase]: 0/59 cut-off events. [2025-02-08 05:32:24,435 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:24,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 59 events. 0/59 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/60 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-02-08 05:32:24,435 INFO L140 encePairwiseOnDemand]: 197/199 looper letters, 1 selfloop transitions, 1 changer transitions 0/59 dead transitions. [2025-02-08 05:32:24,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 59 transitions, 132 flow [2025-02-08 05:32:24,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:32:24,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:32:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2025-02-08 05:32:24,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9447236180904522 [2025-02-08 05:32:24,437 INFO L175 Difference]: Start difference. First operand has 200 places, 191 transitions, 394 flow. Second operand 3 states and 564 transitions. [2025-02-08 05:32:24,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 59 transitions, 132 flow [2025-02-08 05:32:24,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 59 transitions, 122 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:32:24,438 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 120 flow [2025-02-08 05:32:24,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2025-02-08 05:32:24,439 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -135 predicate places. [2025-02-08 05:32:24,439 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 120 flow [2025-02-08 05:32:24,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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:24,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:24,439 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] [2025-02-08 05:32:24,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:32:24,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:32:24,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:24,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1977131087, now seen corresponding path program 1 times [2025-02-08 05:32:24,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:24,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004711320] [2025-02-08 05:32:24,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:24,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:24,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 05:32:24,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 05:32:24,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:24,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:24,699 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:24,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:24,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004711320] [2025-02-08 05:32:24,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004711320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:24,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:24,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:24,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259836775] [2025-02-08 05:32:24,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:24,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:24,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:24,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:24,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:24,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 199 [2025-02-08 05:32:24,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 120 flow. Second operand has 6 states, 6 states have (on average 147.33333333333334) internal successors, (884), 6 states have internal predecessors, (884), 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:24,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:24,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 199 [2025-02-08 05:32:24,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:24,956 INFO L124 PetriNetUnfolderBase]: 0/58 cut-off events. [2025-02-08 05:32:24,956 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:24,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 58 events. 0/58 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/59 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2025-02-08 05:32:24,957 INFO L140 encePairwiseOnDemand]: 194/199 looper letters, 0 selfloop transitions, 0 changer transitions 58/58 dead transitions. [2025-02-08 05:32:24,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 58 transitions, 132 flow [2025-02-08 05:32:24,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:24,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 884 transitions. [2025-02-08 05:32:24,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7403685092127303 [2025-02-08 05:32:24,959 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 120 flow. Second operand 6 states and 884 transitions. [2025-02-08 05:32:24,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 58 transitions, 132 flow [2025-02-08 05:32:24,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 58 transitions, 131 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:24,960 INFO L231 Difference]: Finished difference. Result has 65 places, 0 transitions, 0 flow [2025-02-08 05:32:24,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=65, PETRI_TRANSITIONS=0} [2025-02-08 05:32:24,961 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -132 predicate places. [2025-02-08 05:32:24,961 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 0 transitions, 0 flow [2025-02-08 05:32:24,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.33333333333334) internal successors, (884), 6 states have internal predecessors, (884), 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:24,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (17 of 18 remaining) [2025-02-08 05:32:24,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-02-08 05:32:24,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-02-08 05:32:24,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-02-08 05:32:24,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-02-08 05:32:24,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 18 remaining) [2025-02-08 05:32:24,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-02-08 05:32:24,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-02-08 05:32:24,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-02-08 05:32:24,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-02-08 05:32:24,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-02-08 05:32:24,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-02-08 05:32:24,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-02-08 05:32:24,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-02-08 05:32:24,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-02-08 05:32:24,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-02-08 05:32:24,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-02-08 05:32:24,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-02-08 05:32:24,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:32:24,966 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:32:24,970 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:32:24,970 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:32:24,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:32:24 BasicIcfg [2025-02-08 05:32:24,973 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:32:24,974 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:32:24,974 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:32:24,974 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:32:24,975 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:22" (3/4) ... [2025-02-08 05:32:24,976 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:32:24,978 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-02-08 05:32:24,980 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-08 05:32:24,981 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 05:32:24,981 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 05:32:25,032 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:32:25,033 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:32:25,033 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:32:25,034 INFO L158 Benchmark]: Toolchain (without parser) took 3630.69ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 122.4MB in the beginning and 257.4MB in the end (delta: -135.0MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2025-02-08 05:32:25,034 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:32:25,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 587.51ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 83.5MB in the end (delta: 38.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 05:32:25,034 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.17ms. Allocated memory is still 167.8MB. Free memory was 83.5MB in the beginning and 79.4MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:32:25,034 INFO L158 Benchmark]: Boogie Preprocessor took 37.04ms. Allocated memory is still 167.8MB. Free memory was 79.4MB in the beginning and 76.7MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:32:25,035 INFO L158 Benchmark]: IcfgBuilder took 725.17ms. Allocated memory is still 167.8MB. Free memory was 76.7MB in the beginning and 41.5MB in the end (delta: 35.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 05:32:25,035 INFO L158 Benchmark]: TraceAbstraction took 2149.48ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 41.5MB in the beginning and 264.0MB in the end (delta: -222.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:32:25,035 INFO L158 Benchmark]: Witness Printer took 59.02ms. Allocated memory is still 352.3MB. Free memory was 264.0MB in the beginning and 257.4MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:32:25,036 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 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 587.51ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 83.5MB in the end (delta: 38.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.17ms. Allocated memory is still 167.8MB. Free memory was 83.5MB in the beginning and 79.4MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.04ms. Allocated memory is still 167.8MB. Free memory was 79.4MB in the beginning and 76.7MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 725.17ms. Allocated memory is still 167.8MB. Free memory was 76.7MB in the beginning and 41.5MB in the end (delta: 35.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2149.48ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 41.5MB in the beginning and 264.0MB in the end (delta: -222.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 59.02ms. Allocated memory is still 352.3MB. Free memory was 264.0MB in the beginning and 257.4MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1234]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1264]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1264]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1235]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1265]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1234]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1235]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1249]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1239]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1240]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1241]: 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, 289 locations, 18 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.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 389 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 634 IncrementalHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 80 mSDtfsCounter, 634 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=394occurred in iteration=1, 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, 0.8s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 331 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:25,052 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