./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 034172cc4904075fab6f792587170b7236be9fb41f3a62fa7fbe9a216ec4ca2c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:29:25,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:29:25,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:29:25,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:29:25,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:29:25,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:29:25,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:29:25,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:29:25,666 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:29:25,666 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:29:25,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:29:25,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:29:25,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:29:25,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:29:25,667 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:29:25,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:29:25,667 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:29:25,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:29:25,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:29:25,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:29:25,667 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:29:25,668 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:29:25,668 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:29:25,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:29:25,668 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:29:25,668 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:29:25,668 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:29:25,669 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:29:25,669 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:29:25,669 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:29:25,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:29:25,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:29:25,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:29:25,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:29:25,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:29:25,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:29:25,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:29:25,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:29:25,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:29:25,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:29:25,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:29:25,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:29:25,670 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 034172cc4904075fab6f792587170b7236be9fb41f3a62fa7fbe9a216ec4ca2c [2025-02-08 08:29:25,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:29:25,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:29:25,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:29:25,895 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:29:25,895 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:29:25,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc.i [2025-02-08 08:29:27,121 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/60b105f66/84af9fcf4dba41d8b8c4fc6ac73e60de/FLAGb53d482df [2025-02-08 08:29:27,444 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:29:27,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc.i [2025-02-08 08:29:27,464 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/60b105f66/84af9fcf4dba41d8b8c4fc6ac73e60de/FLAGb53d482df [2025-02-08 08:29:27,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/60b105f66/84af9fcf4dba41d8b8c4fc6ac73e60de [2025-02-08 08:29:27,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:29:27,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:29:27,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:29:27,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:29:27,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:29:27,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:29:27" (1/1) ... [2025-02-08 08:29:27,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e614eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:27, skipping insertion in model container [2025-02-08 08:29:27,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:29:27" (1/1) ... [2025-02-08 08:29:27,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:29:27,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:29:27,948 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:29:28,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:29:28,057 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:29:28,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:28 WrapperNode [2025-02-08 08:29:28,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:29:28,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:29:28,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:29:28,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:29:28,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:28" (1/1) ... [2025-02-08 08:29:28,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:28" (1/1) ... [2025-02-08 08:29:28,109 INFO L138 Inliner]: procedures = 372, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 215 [2025-02-08 08:29:28,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:29:28,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:29:28,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:29:28,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:29:28,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:28" (1/1) ... [2025-02-08 08:29:28,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:28" (1/1) ... [2025-02-08 08:29:28,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:28" (1/1) ... [2025-02-08 08:29:28,138 INFO L175 MemorySlicer]: Split 88 memory accesses to 3 slices as follows [50, 16, 22]. 57 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 17 writes are split as follows [0, 1, 16]. [2025-02-08 08:29:28,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:28" (1/1) ... [2025-02-08 08:29:28,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:28" (1/1) ... [2025-02-08 08:29:28,146 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:28" (1/1) ... [2025-02-08 08:29:28,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:28" (1/1) ... [2025-02-08 08:29:28,148 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:28" (1/1) ... [2025-02-08 08:29:28,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:28" (1/1) ... [2025-02-08 08:29:28,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:29:28,151 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:29:28,151 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:29:28,151 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:29:28,152 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:28" (1/1) ... [2025-02-08 08:29:28,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:29:28,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:29:28,194 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 08:29:28,201 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 08:29:28,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 08:29:28,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 08:29:28,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 08:29:28,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 08:29:28,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 08:29:28,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 08:29:28,220 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 08:29:28,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:29:28,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:29:28,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:29:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:29:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:29:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:29:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 08:29:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:29:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:29:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 08:29:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 08:29:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 08:29:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 08:29:28,221 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 08:29:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:29:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:29:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:29:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:29:28,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:29:28,222 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 08:29:28,368 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:29:28,369 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:29:28,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-8: main_#t~ret38#1.base, main_#t~ret38#1.offset := new_#res#1.base, new_#res#1.offset; [2025-02-08 08:29:28,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-9: havoc new_#t~malloc30#1.base, new_#t~malloc30#1.offset, new_~x#1, new_~p~0#1.base, new_~p~0#1.offset; [2025-02-08 08:29:28,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-10: havoc new_#res#1.base, new_#res#1.offset; [2025-02-08 08:29:28,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-11: assume { :begin_inline_new } true;new_#in~x#1 := 2; [2025-02-08 08:29:28,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-4: havoc list_add_#t~mem31#1.base, list_add_#t~mem31#1.offset, 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 08:29:28,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-5: SUMMARY for call write~$Pointer$#2(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 08:29:28,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-5: assume !(1 == #valid[list_add_~node#1.base]); [2025-02-08 08:29:28,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-5: assume !(4 + (4 + list_add_~node#1.offset) <= #length[list_add_~node#1.base] && 0 <= 4 + list_add_~node#1.offset); [2025-02-08 08:29:28,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1232-1: new_~x#1 := new_#in~x#1; [2025-02-08 08:29:28,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1233-3: havoc new_#t~malloc30#1.base, new_#t~malloc30#1.offset; [2025-02-08 08:29:28,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1233-4: new_~p~0#1.base, new_~p~0#1.offset := new_#t~malloc30#1.base, new_#t~malloc30#1.offset; [2025-02-08 08:29:28,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1233-5: SUMMARY for call new_#t~malloc30#1.base, new_#t~malloc30#1.offset := #Ultimate.allocOnHeap(8); srcloc: null [2025-02-08 08:29:28,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-1: SUMMARY for call write~int#2(new_~x#1, new_~p~0#1.base, new_~p~0#1.offset, 4); srcloc: null [2025-02-08 08:29:28,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-1: assume !(1 == #valid[new_~p~0#1.base]); [2025-02-08 08:29:28,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-1: assume !(4 + new_~p~0#1.offset <= #length[new_~p~0#1.base] && 0 <= new_~p~0#1.offset); [2025-02-08 08:29:28,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-2: new_#res#1.base, new_#res#1.offset := new_~p~0#1.base, new_~p~0#1.offset; [2025-02-08 08:29:28,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-3: SUMMARY for call write~$Pointer$#2(0, 0, new_~p~0#1.base, 4 + new_~p~0#1.offset, 4); srcloc: null [2025-02-08 08:29:28,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-3: assume !(1 == #valid[new_~p~0#1.base]); [2025-02-08 08:29:28,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-3: assume !(4 + (4 + new_~p~0#1.offset) <= #length[new_~p~0#1.base] && 0 <= 4 + new_~p~0#1.offset); [2025-02-08 08:29:28,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1254-1: havoc main_#t~post40#1; [2025-02-08 08:29:28,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1254-2: main_~i~1#1 := 1 + main_#t~post40#1; [2025-02-08 08:29:28,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1254-3: main_#t~post40#1 := main_~i~1#1; [2025-02-08 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238-4: 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 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238-5: 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 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-6: havoc list_add_#t~mem31#1.base, list_add_#t~mem31#1.offset; [2025-02-08 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-7: list_add_~temp~0#1.base, list_add_~temp~0#1.offset := list_add_#t~mem31#1.base, list_add_#t~mem31#1.offset; [2025-02-08 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-8: SUMMARY for call list_add_#t~mem31#1.base, list_add_#t~mem31#1.offset := read~$Pointer$#2(list_add_~list#1.base, 4 + list_add_~list#1.offset, 4); srcloc: null [2025-02-08 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-8: assume !(1 == #valid[list_add_~list#1.base]); [2025-02-08 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-8: assume !(4 + (4 + list_add_~list#1.offset) <= #length[list_add_~list#1.base] && 0 <= 4 + list_add_~list#1.offset); [2025-02-08 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256: havoc main_#t~ret37#1.base, main_#t~ret37#1.offset; [2025-02-08 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256-1: SUMMARY for call write~$Pointer$#1(main_#t~ret37#1.base, main_#t~ret37#1.offset, ~#slot~0.base, ~#slot~0.offset + 4 * main_~i~1#1, 4); srcloc: null [2025-02-08 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256-1: assume !(1 == #valid[~#slot~0.base]); [2025-02-08 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256-1: assume !(4 + (~#slot~0.offset + 4 * main_~i~1#1) <= #length[~#slot~0.base] && 0 <= ~#slot~0.offset + 4 * main_~i~1#1); [2025-02-08 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256-2: havoc new_#in~x#1;assume { :end_inline_new } true; [2025-02-08 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256-3: havoc new_#t~malloc30#1.base, new_#t~malloc30#1.offset, new_~x#1, new_~p~0#1.base, new_~p~0#1.offset; [2025-02-08 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256-4: main_#t~ret37#1.base, main_#t~ret37#1.offset := new_#res#1.base, new_#res#1.offset; [2025-02-08 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-2: SUMMARY for call write~$Pointer$#2(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 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-2: assume !(1 == #valid[list_add_~list#1.base]); [2025-02-08 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-2: assume !(4 + (4 + list_add_~list#1.offset) <= #length[list_add_~list#1.base] && 0 <= 4 + list_add_~list#1.offset); [2025-02-08 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257: havoc main_#t~mem39#1.base, main_#t~mem39#1.offset; [2025-02-08 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-1: assume { :end_inline_list_add } true;havoc main_#t~ret38#1.base, main_#t~ret38#1.offset; [2025-02-08 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-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 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-3: havoc list_add_#t~mem31#1.base, list_add_#t~mem31#1.offset, 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 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-4: 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~ret38#1.base, main_#t~ret38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset; [2025-02-08 08:29:28,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-5: SUMMARY for call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$#1(~#slot~0.base, ~#slot~0.offset + 4 * main_~i~1#1, 4); srcloc: null [2025-02-08 08:29:28,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-5: assume !(1 == #valid[~#slot~0.base]); [2025-02-08 08:29:28,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-5: assume !(4 + (~#slot~0.offset + 4 * main_~i~1#1) <= #length[~#slot~0.base] && 0 <= ~#slot~0.offset + 4 * main_~i~1#1); [2025-02-08 08:29:28,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-6: havoc new_#in~x#1;assume { :end_inline_new } true; [2025-02-08 08:29:28,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-7: havoc new_#t~malloc30#1.base, new_#t~malloc30#1.offset, new_~x#1, new_~p~0#1.base, new_~p~0#1.offset; [2025-02-08 08:29:28,861 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:29:28,861 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:29:29,121 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:29:29,122 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:29:29,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:29:29 BoogieIcfgContainer [2025-02-08 08:29:29,122 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:29:29,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:29:29,124 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:29:29,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:29:29,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:29:27" (1/3) ... [2025-02-08 08:29:29,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4755563f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:29:29, skipping insertion in model container [2025-02-08 08:29:29,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:29:28" (2/3) ... [2025-02-08 08:29:29,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4755563f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:29:29, skipping insertion in model container [2025-02-08 08:29:29,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:29:29" (3/3) ... [2025-02-08 08:29:29,130 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_12-arraycollapse_rc.i [2025-02-08 08:29:29,141 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:29:29,143 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_12-arraycollapse_rc.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 57 error locations. [2025-02-08 08:29:29,143 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:29:29,189 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:29:29,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 80 transitions, 164 flow [2025-02-08 08:29:29,253 INFO L124 PetriNetUnfolderBase]: 0/79 cut-off events. [2025-02-08 08:29:29,256 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:29:29,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 79 events. 0/79 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 201 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-02-08 08:29:29,258 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 80 transitions, 164 flow [2025-02-08 08:29:29,260 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 78 transitions, 159 flow [2025-02-08 08:29:29,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:29:29,277 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=None, 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;@4a3fd159, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:29:29,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-02-08 08:29:29,281 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:29:29,281 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-08 08:29:29,281 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:29:29,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:29,282 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:29:29,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-02-08 08:29:29,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:29,286 INFO L85 PathProgramCache]: Analyzing trace with hash 592246, now seen corresponding path program 1 times [2025-02-08 08:29:29,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:29,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349442713] [2025-02-08 08:29:29,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:29,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:29,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:29:29,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:29:29,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:29,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:29,540 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 08:29:29,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:29,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349442713] [2025-02-08 08:29:29,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349442713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:29,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:29,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:29:29,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331239503] [2025-02-08 08:29:29,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:29,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:29:29,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:29,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:29:29,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:29:29,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:29:29,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 78 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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 08:29:29,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:29,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:29:29,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:29,779 INFO L124 PetriNetUnfolderBase]: 63/269 cut-off events. [2025-02-08 08:29:29,779 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:29:29,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 269 events. 63/269 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1208 event pairs, 63 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 376. Up to 152 conditions per place. [2025-02-08 08:29:29,784 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 26 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2025-02-08 08:29:29,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 209 flow [2025-02-08 08:29:29,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:29:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:29:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2025-02-08 08:29:29,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7125 [2025-02-08 08:29:29,797 INFO L175 Difference]: Start difference. First operand has 82 places, 78 transitions, 159 flow. Second operand 3 states and 171 transitions. [2025-02-08 08:29:29,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 209 flow [2025-02-08 08:29:29,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:29:29,804 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 156 flow [2025-02-08 08:29:29,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2025-02-08 08:29:29,808 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -3 predicate places. [2025-02-08 08:29:29,810 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 156 flow [2025-02-08 08:29:29,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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 08:29:29,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:29,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:29:29,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:29:29,811 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-02-08 08:29:29,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:29,812 INFO L85 PathProgramCache]: Analyzing trace with hash 592247, now seen corresponding path program 1 times [2025-02-08 08:29:29,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:29,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240293658] [2025-02-08 08:29:29,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:29,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:29,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:29:29,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:29:29,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:29,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:29,967 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 08:29:29,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:29,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240293658] [2025-02-08 08:29:29,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240293658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:29,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:29,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:29:29,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537947257] [2025-02-08 08:29:29,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:29,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:29:29,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:29,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:29:29,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:29:30,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 80 [2025-02-08 08:29:30,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 08:29:30,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:30,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 80 [2025-02-08 08:29:30,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:30,094 INFO L124 PetriNetUnfolderBase]: 63/265 cut-off events. [2025-02-08 08:29:30,094 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 08:29:30,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 265 events. 63/265 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1202 event pairs, 63 based on Foata normal form. 4/208 useless extension candidates. Maximal degree in co-relation 410. Up to 152 conditions per place. [2025-02-08 08:29:30,095 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 24 selfloop transitions, 2 changer transitions 2/70 dead transitions. [2025-02-08 08:29:30,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 70 transitions, 202 flow [2025-02-08 08:29:30,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:29:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:29:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2025-02-08 08:29:30,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2025-02-08 08:29:30,097 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 156 flow. Second operand 3 states and 175 transitions. [2025-02-08 08:29:30,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 70 transitions, 202 flow [2025-02-08 08:29:30,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 70 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:29:30,098 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 142 flow [2025-02-08 08:29:30,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2025-02-08 08:29:30,099 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -7 predicate places. [2025-02-08 08:29:30,099 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 142 flow [2025-02-08 08:29:30,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 08:29:30,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:29:30,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:29:30,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:29:30,099 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-02-08 08:29:30,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:29:30,100 INFO L85 PathProgramCache]: Analyzing trace with hash 569236580, now seen corresponding path program 1 times [2025-02-08 08:29:30,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:29:30,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039708291] [2025-02-08 08:29:30,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:29:30,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:29:30,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:29:30,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:29:30,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:29:30,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:29:30,141 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 08:29:30,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:29:30,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039708291] [2025-02-08 08:29:30,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039708291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:29:30,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:29:30,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:29:30,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214062234] [2025-02-08 08:29:30,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:29:30,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:29:30,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:29:30,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:29:30,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:29:30,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 80 [2025-02-08 08:29:30,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 08:29:30,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:29:30,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 80 [2025-02-08 08:29:30,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:29:30,148 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-02-08 08:29:30,148 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:29:30,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5 conditions, 1 events. 0/1 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/2 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-02-08 08:29:30,149 INFO L140 encePairwiseOnDemand]: 78/80 looper letters, 0 selfloop transitions, 0 changer transitions 1/1 dead transitions. [2025-02-08 08:29:30,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 5 places, 1 transitions, 4 flow [2025-02-08 08:29:30,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:29:30,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:29:30,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2025-02-08 08:29:30,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2025-02-08 08:29:30,152 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 142 flow. Second operand 3 states and 158 transitions. [2025-02-08 08:29:30,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 5 places, 1 transitions, 4 flow [2025-02-08 08:29:30,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 5 places, 1 transitions, 4 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:29:30,153 INFO L231 Difference]: Finished difference. Result has 5 places, 0 transitions, 0 flow [2025-02-08 08:29:30,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=2, PETRI_DIFFERENCE_MINUEND_PLACES=3, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=5, PETRI_TRANSITIONS=0} [2025-02-08 08:29:30,153 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -77 predicate places. [2025-02-08 08:29:30,153 INFO L471 AbstractCegarLoop]: Abstraction has has 5 places, 0 transitions, 0 flow [2025-02-08 08:29:30,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 08:29:30,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 56 remaining) [2025-02-08 08:29:30,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 56 remaining) [2025-02-08 08:29:30,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 56 remaining) [2025-02-08 08:29:30,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 56 remaining) [2025-02-08 08:29:30,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 56 remaining) [2025-02-08 08:29:30,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 56 remaining) [2025-02-08 08:29:30,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (25 of 56 remaining) [2025-02-08 08:29:30,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 56 remaining) [2025-02-08 08:29:30,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 56 remaining) [2025-02-08 08:29:30,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 56 remaining) [2025-02-08 08:29:30,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 56 remaining) [2025-02-08 08:29:30,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 56 remaining) [2025-02-08 08:29:30,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 56 remaining) [2025-02-08 08:29:30,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 56 remaining) [2025-02-08 08:29:30,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 56 remaining) [2025-02-08 08:29:30,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 56 remaining) [2025-02-08 08:29:30,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 56 remaining) [2025-02-08 08:29:30,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 56 remaining) [2025-02-08 08:29:30,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 56 remaining) [2025-02-08 08:29:30,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 56 remaining) [2025-02-08 08:29:30,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 56 remaining) [2025-02-08 08:29:30,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 56 remaining) [2025-02-08 08:29:30,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 56 remaining) [2025-02-08 08:29:30,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 56 remaining) [2025-02-08 08:29:30,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 56 remaining) [2025-02-08 08:29:30,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 56 remaining) [2025-02-08 08:29:30,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 56 remaining) [2025-02-08 08:29:30,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 56 remaining) [2025-02-08 08:29:30,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 56 remaining) [2025-02-08 08:29:30,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 56 remaining) [2025-02-08 08:29:30,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 56 remaining) [2025-02-08 08:29:30,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 56 remaining) [2025-02-08 08:29:30,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:29:30,167 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 08:29:30,170 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:29:30,173 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:29:30,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:29:30 BasicIcfg [2025-02-08 08:29:30,180 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:29:30,181 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:29:30,181 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:29:30,181 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:29:30,181 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:29:29" (3/4) ... [2025-02-08 08:29:30,182 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:29:30,184 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-02-08 08:29:30,191 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 86 nodes and edges [2025-02-08 08:29:30,195 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2025-02-08 08:29:30,195 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-02-08 08:29:30,195 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 08:29:30,195 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 08:29:30,195 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:29:30,284 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:29:30,284 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:29:30,284 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:29:30,285 INFO L158 Benchmark]: Toolchain (without parser) took 2802.05ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 80.5MB in the end (delta: 41.9MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2025-02-08 08:29:30,285 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:29:30,285 INFO L158 Benchmark]: CACSL2BoogieTranslator took 573.82ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 82.1MB in the end (delta: 40.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 08:29:30,285 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.51ms. Allocated memory is still 167.8MB. Free memory was 82.1MB in the beginning and 78.6MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:29:30,286 INFO L158 Benchmark]: Boogie Preprocessor took 40.66ms. Allocated memory is still 167.8MB. Free memory was 78.6MB in the beginning and 75.4MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:29:30,286 INFO L158 Benchmark]: IcfgBuilder took 971.40ms. Allocated memory is still 167.8MB. Free memory was 75.4MB in the beginning and 125.0MB in the end (delta: -49.6MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. [2025-02-08 08:29:30,286 INFO L158 Benchmark]: TraceAbstraction took 1056.49ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 87.4MB in the end (delta: 36.7MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2025-02-08 08:29:30,286 INFO L158 Benchmark]: Witness Printer took 103.53ms. Allocated memory is still 167.8MB. Free memory was 87.4MB in the beginning and 80.5MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:29:30,287 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.18ms. Allocated memory is still 201.3MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 573.82ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 82.1MB in the end (delta: 40.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.51ms. Allocated memory is still 167.8MB. Free memory was 82.1MB in the beginning and 78.6MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.66ms. Allocated memory is still 167.8MB. Free memory was 78.6MB in the beginning and 75.4MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 971.40ms. Allocated memory is still 167.8MB. Free memory was 75.4MB in the beginning and 125.0MB in the end (delta: -49.6MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1056.49ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 87.4MB in the end (delta: 36.7MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. * Witness Printer took 103.53ms. Allocated memory is still 167.8MB. Free memory was 87.4MB in the beginning and 80.5MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1253]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 106 locations, 56 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: 0.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 225 IncrementalHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 65 mSDtfsCounter, 225 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=0, InterpolantAutomatonStates: 9, 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.3s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 22 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 57 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:29:30,302 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