./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_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_21-arrayloop2_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 52746884466210ec366bc04a3a6cb03f413619353c73143d79c1024e676e598e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:32:44,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:32:44,192 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:44,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:32:44,195 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:32:44,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:32:44,215 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:32:44,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:32:44,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:32:44,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:32:44,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:32:44,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:32:44,215 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:32:44,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:32:44,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:32:44,216 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:32:44,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:32:44,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:32:44,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:32:44,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:32:44,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:32:44,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:32:44,216 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:32:44,216 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:32:44,216 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:32:44,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:32:44,216 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:32:44,216 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:32:44,216 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:32:44,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:32:44,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:32:44,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:32:44,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:32:44,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:32:44,216 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:32:44,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:32:44,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:32:44,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:32:44,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:32:44,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:32:44,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:32:44,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:32:44,217 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 -> 52746884466210ec366bc04a3a6cb03f413619353c73143d79c1024e676e598e [2025-02-08 05:32:44,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:32:44,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:32:44,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:32:44,401 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:32:44,402 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:32:44,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_nr.i [2025-02-08 05:32:45,484 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b8049b52b/62abc23315144eeea4852ef1e4632a83/FLAG906bb68c1 [2025-02-08 05:32:45,834 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:32:45,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_nr.i [2025-02-08 05:32:45,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b8049b52b/62abc23315144eeea4852ef1e4632a83/FLAG906bb68c1 [2025-02-08 05:32:46,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b8049b52b/62abc23315144eeea4852ef1e4632a83 [2025-02-08 05:32:46,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:32:46,081 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:32:46,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:32:46,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:32:46,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:32:46,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:32:46" (1/1) ... [2025-02-08 05:32:46,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56fc561c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:46, skipping insertion in model container [2025-02-08 05:32:46,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:32:46" (1/1) ... [2025-02-08 05:32:46,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:32:46,390 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:32:46,392 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:32:46,393 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:32:46,393 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:32:46,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:32:46,432 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:32:46,476 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:32:46,480 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:32:46,480 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:32:46,481 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-08 05:32:46,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:32:46,537 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:32:46,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:46 WrapperNode [2025-02-08 05:32:46,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:32:46,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:32:46,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:32:46,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:32:46,544 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:46" (1/1) ... [2025-02-08 05:32:46,562 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:46" (1/1) ... [2025-02-08 05:32:46,582 INFO L138 Inliner]: procedures = 273, calls = 95, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 259 [2025-02-08 05:32:46,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:32:46,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:32:46,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:32:46,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:32:46,595 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:46" (1/1) ... [2025-02-08 05:32:46,595 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:46" (1/1) ... [2025-02-08 05:32:46,602 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:46" (1/1) ... [2025-02-08 05:32:46,602 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:46" (1/1) ... [2025-02-08 05:32:46,613 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:46" (1/1) ... [2025-02-08 05:32:46,614 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:46" (1/1) ... [2025-02-08 05:32:46,616 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:46" (1/1) ... [2025-02-08 05:32:46,616 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:46" (1/1) ... [2025-02-08 05:32:46,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:32:46,619 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:32:46,619 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:32:46,619 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:32:46,620 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:46" (1/1) ... [2025-02-08 05:32:46,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:32:46,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:46,652 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:46,655 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:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-02-08 05:32:46,676 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-02-08 05:32:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 05:32:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 05:32:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:32:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:32:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:32:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:32:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:32:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:32:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 05:32:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:32:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:32:46,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:32:46,677 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:46,790 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:32:46,791 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:32:47,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-1: havoc main_#t~post21#1; [2025-02-08 05:32:47,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-2: main_~j~1#1 := 1 + main_#t~post21#1; [2025-02-08 05:32:47,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-3: assume { :end_inline_list_add } true;main_#t~post21#1 := main_~j~1#1; [2025-02-08 05:32:47,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-4: havoc list_add_#in~new#1.base, list_add_#in~new#1.offset, list_add_#in~head#1.base, list_add_#in~head#1.offset; [2025-02-08 05:32:47,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-5: havoc list_add_#t~mem6#1.base, list_add_#t~mem6#1.offset, list_add_#t~nondet7#1, list_add_#t~nondet8#1, list_add_#t~nondet9#1, list_add_#t~nondet10#1, list_add_~new#1.base, list_add_~new#1.offset, list_add_~head#1.base, list_add_~head#1.offset, list_add_~next~0#1.base, list_add_~next~0#1.offset; [2025-02-08 05:32:47,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-6: havoc list_add_#t~mem6#1.base, list_add_#t~mem6#1.offset, list_add_#t~nondet7#1, list_add_#t~nondet8#1, list_add_#t~nondet9#1, list_add_#t~nondet10#1, list_add_~new#1.base, list_add_~new#1.offset, list_add_~head#1.base, list_add_~head#1.offset, list_add_~next~0#1.base, list_add_~next~0#1.offset; [2025-02-08 05:32:47,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-7: assume { :end_inline_new } true;assume { :begin_inline_list_add } true;list_add_#in~new#1.base, list_add_#in~new#1.offset, list_add_#in~head#1.base, list_add_#in~head#1.offset := main_#t~ret20#1.base, 4 + main_#t~ret20#1.offset, ~#c~0.base, ~#c~0.offset + 8 * main_~i~0#1; [2025-02-08 05:32:47,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-8: havoc new_#in~x#1; [2025-02-08 05:32:47,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-9: havoc new_#t~malloc4#1.base, new_#t~malloc4#1.offset, new_#t~nondet5#1, new_~x#1, new_~p~0#1.base, new_~p~0#1.offset; [2025-02-08 05:32:47,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-10: main_#t~ret20#1.base, main_#t~ret20#1.offset := new_#res#1.base, new_#res#1.offset; [2025-02-08 05:32:47,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1015: list_add_~head#1.base, list_add_~head#1.offset := list_add_#in~head#1.base, list_add_#in~head#1.offset; [2025-02-08 05:32:47,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1015-1: list_add_~new#1.base, list_add_~new#1.offset := list_add_#in~new#1.base, list_add_#in~new#1.offset; [2025-02-08 05:32:47,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016: havoc list_add_#t~mem6#1.base, list_add_#t~mem6#1.offset; [2025-02-08 05:32:47,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-1: assume ((0 == #race[list_add_~head#1.base,list_add_~head#1.offset] && 0 == #race[list_add_~head#1.base,1 + list_add_~head#1.offset]) && 0 == #race[list_add_~head#1.base,2 + list_add_~head#1.offset]) && 0 == #race[list_add_~head#1.base,3 + list_add_~head#1.offset]; [2025-02-08 05:32:47,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-1: assume !(((0 == #race[list_add_~head#1.base,list_add_~head#1.offset] && 0 == #race[list_add_~head#1.base,1 + list_add_~head#1.offset]) && 0 == #race[list_add_~head#1.base,2 + list_add_~head#1.offset]) && 0 == #race[list_add_~head#1.base,3 + list_add_~head#1.offset]); [2025-02-08 05:32:47,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-2: list_add_~next~0#1.base, list_add_~next~0#1.offset := list_add_#t~mem6#1.base, list_add_#t~mem6#1.offset; [2025-02-08 05:32:47,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-3: #race := #race[list_add_~head#1.base,3 + list_add_~head#1.offset := 0]; [2025-02-08 05:32:47,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-4: #race := #race[list_add_~head#1.base,2 + list_add_~head#1.offset := 0]; [2025-02-08 05:32:47,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-5: #race := #race[list_add_~head#1.base,1 + list_add_~head#1.offset := 0]; [2025-02-08 05:32:47,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-6: #race := #race[list_add_~head#1.base,list_add_~head#1.offset := 0]; [2025-02-08 05:32:47,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-7: SUMMARY for call list_add_#t~mem6#1.base, list_add_#t~mem6#1.offset := read~$Pointer$(list_add_~head#1.base, list_add_~head#1.offset, 4); srcloc: null [2025-02-08 05:32:47,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017: assume ((#race[list_add_~next~0#1.base,4 + list_add_~next~0#1.offset] == list_add_#t~nondet7#1 && #race[list_add_~next~0#1.base,5 + list_add_~next~0#1.offset] == list_add_#t~nondet7#1) && #race[list_add_~next~0#1.base,6 + list_add_~next~0#1.offset] == list_add_#t~nondet7#1) && #race[list_add_~next~0#1.base,7 + list_add_~next~0#1.offset] == list_add_#t~nondet7#1; [2025-02-08 05:32:47,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017: assume !(((#race[list_add_~next~0#1.base,4 + list_add_~next~0#1.offset] == list_add_#t~nondet7#1 && #race[list_add_~next~0#1.base,5 + list_add_~next~0#1.offset] == list_add_#t~nondet7#1) && #race[list_add_~next~0#1.base,6 + list_add_~next~0#1.offset] == list_add_#t~nondet7#1) && #race[list_add_~next~0#1.base,7 + list_add_~next~0#1.offset] == list_add_#t~nondet7#1); [2025-02-08 05:32:47,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-1: havoc list_add_#t~nondet7#1; [2025-02-08 05:32:47,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-2: #race := #race[list_add_~next~0#1.base,7 + list_add_~next~0#1.offset := list_add_#t~nondet7#1]; [2025-02-08 05:32:47,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-3: #race := #race[list_add_~next~0#1.base,6 + list_add_~next~0#1.offset := list_add_#t~nondet7#1]; [2025-02-08 05:32:47,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-4: #race := #race[list_add_~next~0#1.base,5 + list_add_~next~0#1.offset := list_add_#t~nondet7#1]; [2025-02-08 05:32:47,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-5: #race := #race[list_add_~next~0#1.base,4 + list_add_~next~0#1.offset := list_add_#t~nondet7#1]; [2025-02-08 05:32:47,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-6: havoc list_add_#t~nondet7#1; [2025-02-08 05:32:47,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-7: SUMMARY for call write~$Pointer$(list_add_~new#1.base, list_add_~new#1.offset, list_add_~next~0#1.base, 4 + list_add_~next~0#1.offset, 4); srcloc: null [2025-02-08 05:32:47,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018: assume ((#race[list_add_~new#1.base,list_add_~new#1.offset] == list_add_#t~nondet8#1 && #race[list_add_~new#1.base,1 + list_add_~new#1.offset] == list_add_#t~nondet8#1) && #race[list_add_~new#1.base,2 + list_add_~new#1.offset] == list_add_#t~nondet8#1) && #race[list_add_~new#1.base,3 + list_add_~new#1.offset] == list_add_#t~nondet8#1; [2025-02-08 05:32:47,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018: assume !(((#race[list_add_~new#1.base,list_add_~new#1.offset] == list_add_#t~nondet8#1 && #race[list_add_~new#1.base,1 + list_add_~new#1.offset] == list_add_#t~nondet8#1) && #race[list_add_~new#1.base,2 + list_add_~new#1.offset] == list_add_#t~nondet8#1) && #race[list_add_~new#1.base,3 + list_add_~new#1.offset] == list_add_#t~nondet8#1); [2025-02-08 05:32:47,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018-1: havoc list_add_#t~nondet8#1; [2025-02-08 05:32:47,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018-2: #race := #race[list_add_~new#1.base,3 + list_add_~new#1.offset := list_add_#t~nondet8#1]; [2025-02-08 05:32:47,171 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018-3: #race := #race[list_add_~new#1.base,2 + list_add_~new#1.offset := list_add_#t~nondet8#1]; [2025-02-08 05:32:47,171 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018-4: #race := #race[list_add_~new#1.base,1 + list_add_~new#1.offset := list_add_#t~nondet8#1]; [2025-02-08 05:32:47,171 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018-5: #race := #race[list_add_~new#1.base,list_add_~new#1.offset := list_add_#t~nondet8#1]; [2025-02-08 05:32:47,171 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018-6: havoc list_add_#t~nondet8#1; [2025-02-08 05:32:47,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018-7: SUMMARY for call write~$Pointer$(list_add_~next~0#1.base, list_add_~next~0#1.offset, list_add_~new#1.base, list_add_~new#1.offset, 4); srcloc: null [2025-02-08 05:32:47,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019: assume ((#race[list_add_~new#1.base,4 + list_add_~new#1.offset] == list_add_#t~nondet9#1 && #race[list_add_~new#1.base,5 + list_add_~new#1.offset] == list_add_#t~nondet9#1) && #race[list_add_~new#1.base,6 + list_add_~new#1.offset] == list_add_#t~nondet9#1) && #race[list_add_~new#1.base,7 + list_add_~new#1.offset] == list_add_#t~nondet9#1; [2025-02-08 05:32:47,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019: assume !(((#race[list_add_~new#1.base,4 + list_add_~new#1.offset] == list_add_#t~nondet9#1 && #race[list_add_~new#1.base,5 + list_add_~new#1.offset] == list_add_#t~nondet9#1) && #race[list_add_~new#1.base,6 + list_add_~new#1.offset] == list_add_#t~nondet9#1) && #race[list_add_~new#1.base,7 + list_add_~new#1.offset] == list_add_#t~nondet9#1); [2025-02-08 05:32:47,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019-1: havoc list_add_#t~nondet9#1; [2025-02-08 05:32:47,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019-2: #race := #race[list_add_~new#1.base,7 + list_add_~new#1.offset := list_add_#t~nondet9#1]; [2025-02-08 05:32:47,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019-3: #race := #race[list_add_~new#1.base,6 + list_add_~new#1.offset := list_add_#t~nondet9#1]; [2025-02-08 05:32:47,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019-4: #race := #race[list_add_~new#1.base,5 + list_add_~new#1.offset := list_add_#t~nondet9#1]; [2025-02-08 05:32:47,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019-5: #race := #race[list_add_~new#1.base,4 + list_add_~new#1.offset := list_add_#t~nondet9#1]; [2025-02-08 05:32:47,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019-6: havoc list_add_#t~nondet9#1; [2025-02-08 05:32:47,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019-7: SUMMARY for call write~$Pointer$(list_add_~head#1.base, list_add_~head#1.offset, list_add_~new#1.base, 4 + list_add_~new#1.offset, 4); srcloc: null [2025-02-08 05:32:47,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1020: assume ((#race[list_add_~head#1.base,list_add_~head#1.offset] == list_add_#t~nondet10#1 && #race[list_add_~head#1.base,1 + list_add_~head#1.offset] == list_add_#t~nondet10#1) && #race[list_add_~head#1.base,2 + list_add_~head#1.offset] == list_add_#t~nondet10#1) && #race[list_add_~head#1.base,3 + list_add_~head#1.offset] == list_add_#t~nondet10#1; [2025-02-08 05:32:47,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1020: assume !(((#race[list_add_~head#1.base,list_add_~head#1.offset] == list_add_#t~nondet10#1 && #race[list_add_~head#1.base,1 + list_add_~head#1.offset] == list_add_#t~nondet10#1) && #race[list_add_~head#1.base,2 + list_add_~head#1.offset] == list_add_#t~nondet10#1) && #race[list_add_~head#1.base,3 + list_add_~head#1.offset] == list_add_#t~nondet10#1); [2025-02-08 05:32:47,173 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1020-1: havoc list_add_#t~nondet10#1; [2025-02-08 05:32:47,173 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1020-2: #race := #race[list_add_~head#1.base,3 + list_add_~head#1.offset := list_add_#t~nondet10#1]; [2025-02-08 05:32:47,173 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1020-3: #race := #race[list_add_~head#1.base,2 + list_add_~head#1.offset := list_add_#t~nondet10#1]; [2025-02-08 05:32:47,173 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1020-4: #race := #race[list_add_~head#1.base,1 + list_add_~head#1.offset := list_add_#t~nondet10#1]; [2025-02-08 05:32:47,173 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1020-5: #race := #race[list_add_~head#1.base,list_add_~head#1.offset := list_add_#t~nondet10#1]; [2025-02-08 05:32:47,173 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1020-6: havoc list_add_#t~nondet10#1; [2025-02-08 05:32:47,173 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1020-7: SUMMARY for call write~$Pointer$(list_add_~new#1.base, list_add_~new#1.offset, list_add_~head#1.base, list_add_~head#1.offset, 4); srcloc: null [2025-02-08 05:32:47,174 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:32:47,174 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:32:47,195 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:32:47,199 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:32:47,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:47 BoogieIcfgContainer [2025-02-08 05:32:47,199 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:32:47,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:32:47,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:32:47,205 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:32:47,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:32:46" (1/3) ... [2025-02-08 05:32:47,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1935447d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:47, skipping insertion in model container [2025-02-08 05:32:47,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:46" (2/3) ... [2025-02-08 05:32:47,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1935447d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:47, skipping insertion in model container [2025-02-08 05:32:47,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:47" (3/3) ... [2025-02-08 05:32:47,208 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_21-arrayloop2_nr.i [2025-02-08 05:32:47,219 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:32:47,220 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_21-arrayloop2_nr.i that has 2 procedures, 235 locations, 1 initial locations, 4 loop locations, and 14 error locations. [2025-02-08 05:32:47,220 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:32:47,315 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:32:47,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 307 places, 307 transitions, 622 flow [2025-02-08 05:32:47,473 INFO L124 PetriNetUnfolderBase]: 7/305 cut-off events. [2025-02-08 05:32:47,475 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:47,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 7/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 586 event pairs, 0 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 232. Up to 2 conditions per place. [2025-02-08 05:32:47,481 INFO L82 GeneralOperation]: Start removeDead. Operand has 307 places, 307 transitions, 622 flow [2025-02-08 05:32:47,485 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 300 places, 300 transitions, 606 flow [2025-02-08 05:32:47,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:32:47,497 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;@46d4e190, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:32:47,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-02-08 05:32:47,519 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:32:47,520 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-02-08 05:32:47,520 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:47,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:47,520 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] [2025-02-08 05:32:47,521 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:32:47,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:47,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1721010355, now seen corresponding path program 1 times [2025-02-08 05:32:47,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:47,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029280432] [2025-02-08 05:32:47,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:47,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:47,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 05:32:47,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 05:32:47,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:47,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:48,327 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:48,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:48,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029280432] [2025-02-08 05:32:48,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029280432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:48,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:48,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:48,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731631459] [2025-02-08 05:32:48,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:48,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:48,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:48,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:48,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:48,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 307 [2025-02-08 05:32:48,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 300 transitions, 606 flow. Second operand has 6 states, 6 states have (on average 242.33333333333334) internal successors, (1454), 6 states have internal predecessors, (1454), 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:48,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:48,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 307 [2025-02-08 05:32:48,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:48,966 INFO L124 PetriNetUnfolderBase]: 448/1779 cut-off events. [2025-02-08 05:32:48,967 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-08 05:32:48,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2657 conditions, 1779 events. 448/1779 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 11011 event pairs, 342 based on Foata normal form. 34/1612 useless extension candidates. Maximal degree in co-relation 2477. Up to 825 conditions per place. [2025-02-08 05:32:48,980 INFO L140 encePairwiseOnDemand]: 293/307 looper letters, 51 selfloop transitions, 10 changer transitions 0/296 dead transitions. [2025-02-08 05:32:48,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 296 transitions, 720 flow [2025-02-08 05:32:48,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:48,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:48,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1511 transitions. [2025-02-08 05:32:48,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8203040173724213 [2025-02-08 05:32:48,995 INFO L175 Difference]: Start difference. First operand has 300 places, 300 transitions, 606 flow. Second operand 6 states and 1511 transitions. [2025-02-08 05:32:48,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 296 transitions, 720 flow [2025-02-08 05:32:49,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 296 transitions, 718 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:32:49,005 INFO L231 Difference]: Finished difference. Result has 301 places, 296 transitions, 616 flow [2025-02-08 05:32:49,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=616, PETRI_PLACES=301, PETRI_TRANSITIONS=296} [2025-02-08 05:32:49,011 INFO L279 CegarLoopForPetriNet]: 300 programPoint places, 1 predicate places. [2025-02-08 05:32:49,012 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 296 transitions, 616 flow [2025-02-08 05:32:49,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.33333333333334) internal successors, (1454), 6 states have internal predecessors, (1454), 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:49,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:49,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:49,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:32:49,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:32:49,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:49,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1797994946, now seen corresponding path program 1 times [2025-02-08 05:32:49,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:49,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508472332] [2025-02-08 05:32:49,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:49,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:49,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 05:32:49,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 05:32:49,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:49,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:49,375 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:49,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:49,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508472332] [2025-02-08 05:32:49,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508472332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:49,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:49,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:49,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852557262] [2025-02-08 05:32:49,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:49,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:49,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:49,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:49,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:49,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 307 [2025-02-08 05:32:49,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 296 transitions, 616 flow. Second operand has 6 states, 6 states have (on average 242.33333333333334) internal successors, (1454), 6 states have internal predecessors, (1454), 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:49,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:49,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 307 [2025-02-08 05:32:49,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:49,974 INFO L124 PetriNetUnfolderBase]: 448/1777 cut-off events. [2025-02-08 05:32:49,974 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:49,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2662 conditions, 1777 events. 448/1777 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10979 event pairs, 342 based on Foata normal form. 1/1578 useless extension candidates. Maximal degree in co-relation 2573. Up to 824 conditions per place. [2025-02-08 05:32:49,984 INFO L140 encePairwiseOnDemand]: 296/307 looper letters, 47 selfloop transitions, 5 changer transitions 19/294 dead transitions. [2025-02-08 05:32:49,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 294 transitions, 730 flow [2025-02-08 05:32:49,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:49,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1507 transitions. [2025-02-08 05:32:49,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8181324647122693 [2025-02-08 05:32:49,989 INFO L175 Difference]: Start difference. First operand has 301 places, 296 transitions, 616 flow. Second operand 6 states and 1507 transitions. [2025-02-08 05:32:49,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 294 transitions, 730 flow [2025-02-08 05:32:49,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 294 transitions, 710 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:32:49,998 INFO L231 Difference]: Finished difference. Result has 299 places, 275 transitions, 564 flow [2025-02-08 05:32:49,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=564, PETRI_PLACES=299, PETRI_TRANSITIONS=275} [2025-02-08 05:32:49,998 INFO L279 CegarLoopForPetriNet]: 300 programPoint places, -1 predicate places. [2025-02-08 05:32:49,998 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 275 transitions, 564 flow [2025-02-08 05:32:49,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.33333333333334) internal successors, (1454), 6 states have internal predecessors, (1454), 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:49,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:49,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:49,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:32:49,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:32:50,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:50,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1613633298, now seen corresponding path program 1 times [2025-02-08 05:32:50,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:50,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169865087] [2025-02-08 05:32:50,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:50,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:50,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 05:32:50,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 05:32:50,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:50,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:50,107 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:50,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:50,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169865087] [2025-02-08 05:32:50,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169865087] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:50,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:50,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:32:50,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891487053] [2025-02-08 05:32:50,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:50,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:32:50,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:50,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:32:50,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:32:50,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 307 [2025-02-08 05:32:50,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 275 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 295.0) internal successors, (885), 3 states have internal predecessors, (885), 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:50,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:50,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 307 [2025-02-08 05:32:50,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:50,174 INFO L124 PetriNetUnfolderBase]: 27/496 cut-off events. [2025-02-08 05:32:50,174 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:50,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 496 events. 27/496 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1589 event pairs, 18 based on Foata normal form. 1/457 useless extension candidates. Maximal degree in co-relation 418. Up to 45 conditions per place. [2025-02-08 05:32:50,177 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 11 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2025-02-08 05:32:50,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 276 transitions, 592 flow [2025-02-08 05:32:50,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:32:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:32:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2025-02-08 05:32:50,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695982627578719 [2025-02-08 05:32:50,180 INFO L175 Difference]: Start difference. First operand has 299 places, 275 transitions, 564 flow. Second operand 3 states and 893 transitions. [2025-02-08 05:32:50,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 276 transitions, 592 flow [2025-02-08 05:32:50,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 276 transitions, 582 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:32:50,186 INFO L231 Difference]: Finished difference. Result has 278 places, 276 transitions, 566 flow [2025-02-08 05:32:50,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=278, PETRI_TRANSITIONS=276} [2025-02-08 05:32:50,187 INFO L279 CegarLoopForPetriNet]: 300 programPoint places, -22 predicate places. [2025-02-08 05:32:50,187 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 276 transitions, 566 flow [2025-02-08 05:32:50,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.0) internal successors, (885), 3 states have internal predecessors, (885), 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:50,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:50,188 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:50,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:32:50,188 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:32:50,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:50,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2146013496, now seen corresponding path program 1 times [2025-02-08 05:32:50,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:50,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742433640] [2025-02-08 05:32:50,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:50,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:50,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-08 05:32:50,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 05:32:50,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:50,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:50,524 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:50,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:50,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742433640] [2025-02-08 05:32:50,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742433640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:50,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:50,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:50,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747827154] [2025-02-08 05:32:50,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:50,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:50,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:50,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:50,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:50,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 307 [2025-02-08 05:32:50,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 276 transitions, 566 flow. Second operand has 6 states, 6 states have (on average 243.66666666666666) internal successors, (1462), 6 states have internal predecessors, (1462), 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:50,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:50,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 307 [2025-02-08 05:32:50,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:50,986 INFO L124 PetriNetUnfolderBase]: 448/1799 cut-off events. [2025-02-08 05:32:50,986 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:32:50,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2689 conditions, 1799 events. 448/1799 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10864 event pairs, 342 based on Foata normal form. 2/1602 useless extension candidates. Maximal degree in co-relation 2546. Up to 834 conditions per place. [2025-02-08 05:32:50,995 INFO L140 encePairwiseOnDemand]: 302/307 looper letters, 46 selfloop transitions, 0 changer transitions 14/275 dead transitions. [2025-02-08 05:32:50,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 275 transitions, 670 flow [2025-02-08 05:32:50,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:50,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1500 transitions. [2025-02-08 05:32:50,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8143322475570033 [2025-02-08 05:32:50,998 INFO L175 Difference]: Start difference. First operand has 278 places, 276 transitions, 566 flow. Second operand 6 states and 1500 transitions. [2025-02-08 05:32:50,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 275 transitions, 670 flow [2025-02-08 05:32:50,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 275 transitions, 668 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:51,001 INFO L231 Difference]: Finished difference. Result has 281 places, 261 transitions, 534 flow [2025-02-08 05:32:51,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=534, PETRI_PLACES=281, PETRI_TRANSITIONS=261} [2025-02-08 05:32:51,003 INFO L279 CegarLoopForPetriNet]: 300 programPoint places, -19 predicate places. [2025-02-08 05:32:51,003 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 261 transitions, 534 flow [2025-02-08 05:32:51,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 243.66666666666666) internal successors, (1462), 6 states have internal predecessors, (1462), 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:51,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:51,004 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:51,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:32:51,004 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:32:51,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:51,004 INFO L85 PathProgramCache]: Analyzing trace with hash -208595951, now seen corresponding path program 1 times [2025-02-08 05:32:51,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:51,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524439939] [2025-02-08 05:32:51,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:51,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:51,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-08 05:32:51,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-08 05:32:51,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:51,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:51,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:32:51,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:51,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524439939] [2025-02-08 05:32:51,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524439939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:51,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:51,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:32:51,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424935899] [2025-02-08 05:32:51,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:51,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:32:51,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:51,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:32:51,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:32:51,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 307 [2025-02-08 05:32:51,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 261 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 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:51,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:51,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 307 [2025-02-08 05:32:51,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:51,087 INFO L124 PetriNetUnfolderBase]: 0/103 cut-off events. [2025-02-08 05:32:51,088 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:51,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 103 events. 0/103 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/104 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-02-08 05:32:51,088 INFO L140 encePairwiseOnDemand]: 305/307 looper letters, 0 selfloop transitions, 0 changer transitions 103/103 dead transitions. [2025-02-08 05:32:51,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 103 transitions, 212 flow [2025-02-08 05:32:51,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:32:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:32:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 885 transitions. [2025-02-08 05:32:51,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9609120521172638 [2025-02-08 05:32:51,089 INFO L175 Difference]: Start difference. First operand has 281 places, 261 transitions, 534 flow. Second operand 3 states and 885 transitions. [2025-02-08 05:32:51,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 103 transitions, 212 flow [2025-02-08 05:32:51,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 103 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:51,090 INFO L231 Difference]: Finished difference. Result has 108 places, 0 transitions, 0 flow [2025-02-08 05:32:51,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=108, PETRI_TRANSITIONS=0} [2025-02-08 05:32:51,091 INFO L279 CegarLoopForPetriNet]: 300 programPoint places, -192 predicate places. [2025-02-08 05:32:51,091 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 0 transitions, 0 flow [2025-02-08 05:32:51,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 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:51,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr3ASSERT_VIOLATIONDATA_RACE (18 of 19 remaining) [2025-02-08 05:32:51,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr2ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2025-02-08 05:32:51,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr1ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2025-02-08 05:32:51,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr0ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2025-02-08 05:32:51,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2025-02-08 05:32:51,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2025-02-08 05:32:51,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2025-02-08 05:32:51,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2025-02-08 05:32:51,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2025-02-08 05:32:51,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 19 remaining) [2025-02-08 05:32:51,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 19 remaining) [2025-02-08 05:32:51,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr3ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining) [2025-02-08 05:32:51,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr2ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2025-02-08 05:32:51,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr1ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2025-02-08 05:32:51,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr0ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2025-02-08 05:32:51,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr3ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2025-02-08 05:32:51,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr2ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2025-02-08 05:32:51,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr1ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2025-02-08 05:32:51,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr0ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2025-02-08 05:32:51,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:32:51,095 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 05:32:51,098 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:32:51,099 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:32:51,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:32:51 BasicIcfg [2025-02-08 05:32:51,103 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:32:51,104 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:32:51,104 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:32:51,104 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:32:51,104 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:47" (3/4) ... [2025-02-08 05:32:51,105 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:32:51,108 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure f [2025-02-08 05:32:51,111 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-08 05:32:51,112 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:32:51,112 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:32:51,173 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:32:51,173 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:32:51,173 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:32:51,174 INFO L158 Benchmark]: Toolchain (without parser) took 5092.57ms. Allocated memory was 201.3MB in the beginning and 251.7MB in the end (delta: 50.3MB). Free memory was 157.7MB in the beginning and 143.1MB in the end (delta: 14.6MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2025-02-08 05:32:51,174 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 218.1MB. Free memory is still 134.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:32:51,174 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.10ms. Allocated memory is still 201.3MB. Free memory was 157.4MB in the beginning and 126.2MB in the end (delta: 31.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 05:32:51,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.46ms. Allocated memory is still 201.3MB. Free memory was 125.8MB in the beginning and 122.1MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:32:51,175 INFO L158 Benchmark]: Boogie Preprocessor took 31.79ms. Allocated memory is still 201.3MB. Free memory was 122.1MB in the beginning and 119.4MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:32:51,175 INFO L158 Benchmark]: IcfgBuilder took 579.83ms. Allocated memory is still 201.3MB. Free memory was 119.4MB in the beginning and 85.1MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 05:32:51,175 INFO L158 Benchmark]: TraceAbstraction took 3902.70ms. Allocated memory was 201.3MB in the beginning and 251.7MB in the end (delta: 50.3MB). Free memory was 84.5MB in the beginning and 148.0MB in the end (delta: -63.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:32:51,175 INFO L158 Benchmark]: Witness Printer took 69.26ms. Allocated memory is still 251.7MB. Free memory was 148.0MB in the beginning and 143.1MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:32:51,176 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.12ms. Allocated memory is still 218.1MB. Free memory is still 134.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.10ms. Allocated memory is still 201.3MB. Free memory was 157.4MB in the beginning and 126.2MB in the end (delta: 31.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.46ms. Allocated memory is still 201.3MB. Free memory was 125.8MB in the beginning and 122.1MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.79ms. Allocated memory is still 201.3MB. Free memory was 122.1MB in the beginning and 119.4MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 579.83ms. Allocated memory is still 201.3MB. Free memory was 119.4MB in the beginning and 85.1MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3902.70ms. Allocated memory was 201.3MB in the beginning and 251.7MB in the end (delta: 50.3MB). Free memory was 84.5MB in the beginning and 148.0MB in the end (delta: -63.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 69.26ms. Allocated memory is still 251.7MB. Free memory was 148.0MB in the beginning and 143.1MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1030]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1033]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1033]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1034]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1006]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1007]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1011]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1006]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1007]: 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 4 procedures, 369 locations, 19 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: 3.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 652 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 341 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1260 IncrementalHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 5 mSDtfsCounter, 1260 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=616occurred in iteration=1, InterpolantAutomatonStates: 24, 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.4s InterpolantComputationTime, 551 NumberOfCodeBlocks, 551 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 546 ConstructedInterpolants, 0 QuantifiedInterpolants, 801 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2/2 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 14 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:32:51,188 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