./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:39:45,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:39:45,584 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:39:45,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:39:45,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:39:45,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:39:45,604 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:39:45,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:39:45,604 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:39:45,604 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:39:45,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:39:45,604 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:39:45,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:39:45,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:39:45,605 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:39:45,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:39:45,605 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:39:45,605 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:39:45,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:39:45,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:39:45,605 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:39:45,605 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:39:45,605 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:39:45,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:39:45,606 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:39:45,606 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:39:45,606 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:39:45,606 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:39:45,606 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:39:45,606 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:39:45,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:39:45,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:39:45,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:39:45,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:39:45,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:39:45,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:39:45,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:39:45,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:39:45,607 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:39:45,607 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:39:45,607 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:39:45,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:39:45,607 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 [2025-03-04 07:39:45,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:39:45,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:39:45,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:39:45,858 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:39:45,858 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:39:45,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2025-03-04 07:39:47,075 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f1323224/8b9f49364673469a87ca5e2ca26954f2/FLAG38e7d838a [2025-03-04 07:39:47,344 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:39:47,345 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2025-03-04 07:39:47,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f1323224/8b9f49364673469a87ca5e2ca26954f2/FLAG38e7d838a [2025-03-04 07:39:47,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f1323224/8b9f49364673469a87ca5e2ca26954f2 [2025-03-04 07:39:47,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:39:47,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:39:47,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:39:47,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:39:47,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:39:47,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:39:47" (1/1) ... [2025-03-04 07:39:47,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dc7bff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:47, skipping insertion in model container [2025-03-04 07:39:47,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:39:47" (1/1) ... [2025-03-04 07:39:47,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:39:47,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:39:47,872 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:39:47,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:39:47,944 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:39:47,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:47 WrapperNode [2025-03-04 07:39:47,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:39:47,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:39:47,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:39:47,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:39:47,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:47" (1/1) ... [2025-03-04 07:39:47,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:47" (1/1) ... [2025-03-04 07:39:47,984 INFO L138 Inliner]: procedures = 125, calls = 94, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 344 [2025-03-04 07:39:47,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:39:47,985 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:39:47,985 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:39:47,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:39:47,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:47" (1/1) ... [2025-03-04 07:39:47,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:47" (1/1) ... [2025-03-04 07:39:47,995 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:47" (1/1) ... [2025-03-04 07:39:48,024 INFO L175 MemorySlicer]: Split 66 memory accesses to 3 slices as follows [2, 54, 10]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 11 writes are split as follows [0, 6, 5]. [2025-03-04 07:39:48,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:47" (1/1) ... [2025-03-04 07:39:48,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:47" (1/1) ... [2025-03-04 07:39:48,034 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:47" (1/1) ... [2025-03-04 07:39:48,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:47" (1/1) ... [2025-03-04 07:39:48,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:47" (1/1) ... [2025-03-04 07:39:48,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:47" (1/1) ... [2025-03-04 07:39:48,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:39:48,046 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:39:48,050 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:39:48,050 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:39:48,051 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:47" (1/1) ... [2025-03-04 07:39:48,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:39:48,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:39:48,078 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:39:48,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:39:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:39:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:39:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 07:39:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:39:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:39:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 07:39:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:39:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:39:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:39:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:39:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 07:39:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:39:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:39:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:39:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:39:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:39:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:39:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 07:39:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:39:48,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:39:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure append [2025-03-04 07:39:48,101 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2025-03-04 07:39:48,192 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:39:48,194 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:39:48,603 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L551: havoc containsHead_#t~mem3#1;havoc containsHead_#t~mem4#1.base, containsHead_#t~mem4#1.offset;havoc containsHead_#t~mem5#1;havoc containsHead_#t~short6#1;havoc containsHead_#t~mem7#1.base, containsHead_#t~mem7#1.offset;havoc containsHead_#t~mem8#1.base, containsHead_#t~mem8#1.offset;havoc containsHead_#t~mem9#1;havoc containsHead_#t~short10#1;havoc containsHead_#t~mem11#1.base, containsHead_#t~mem11#1.offset;havoc containsHead_#t~mem12#1.base, containsHead_#t~mem12#1.offset;havoc containsHead_#t~mem13#1.base, containsHead_#t~mem13#1.offset;havoc containsHead_#t~mem14#1;havoc containsHead_#t~short15#1;havoc containsHead_#t~mem16#1.base, containsHead_#t~mem16#1.offset;havoc containsHead_#t~mem17#1.base, containsHead_#t~mem17#1.offset;havoc containsHead_#t~mem18#1.base, containsHead_#t~mem18#1.offset;havoc containsHead_#t~mem19#1.base, containsHead_#t~mem19#1.offset;havoc containsHead_#t~mem20#1;havoc containsHead_#t~short21#1;havoc containsHead_#t~mem22#1.base, containsHead_#t~mem22#1.offset;havoc containsHead_#t~mem23#1.base, containsHead_#t~mem23#1.offset;havoc containsHead_#t~mem24#1.base, containsHead_#t~mem24#1.offset;havoc containsHead_#t~mem25#1.base, containsHead_#t~mem25#1.offset;havoc containsHead_#t~mem26#1.base, containsHead_#t~mem26#1.offset;havoc containsHead_#t~mem27#1;havoc containsHead_#t~short28#1; [2025-03-04 07:39:48,603 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L555: havoc containsBody_#t~mem29#1;havoc containsBody_#t~mem30#1.base, containsBody_#t~mem30#1.offset;havoc containsBody_#t~mem31#1;havoc containsBody_#t~short32#1;havoc containsBody_#t~mem33#1.base, containsBody_#t~mem33#1.offset;havoc containsBody_#t~mem34#1.base, containsBody_#t~mem34#1.offset;havoc containsBody_#t~mem35#1;havoc containsBody_#t~short36#1;havoc containsBody_#t~mem37#1.base, containsBody_#t~mem37#1.offset;havoc containsBody_#t~mem38#1.base, containsBody_#t~mem38#1.offset;havoc containsBody_#t~mem39#1.base, containsBody_#t~mem39#1.offset;havoc containsBody_#t~mem40#1;havoc containsBody_#t~short41#1;havoc containsBody_#t~mem42#1.base, containsBody_#t~mem42#1.offset;havoc containsBody_#t~mem43#1.base, containsBody_#t~mem43#1.offset;havoc containsBody_#t~mem44#1.base, containsBody_#t~mem44#1.offset;havoc containsBody_#t~mem45#1.base, containsBody_#t~mem45#1.offset;havoc containsBody_#t~mem46#1;havoc containsBody_#t~short47#1;havoc containsBody_#t~mem48#1.base, containsBody_#t~mem48#1.offset;havoc containsBody_#t~mem49#1.base, containsBody_#t~mem49#1.offset;havoc containsBody_#t~mem50#1.base, containsBody_#t~mem50#1.offset;havoc containsBody_#t~mem51#1.base, containsBody_#t~mem51#1.offset;havoc containsBody_#t~mem52#1.base, containsBody_#t~mem52#1.offset;havoc containsBody_#t~mem53#1;havoc containsBody_#t~short54#1; [2025-03-04 07:39:48,711 INFO L? ?]: Removed 360 outVars from TransFormulas that were not future-live. [2025-03-04 07:39:48,711 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:39:48,725 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:39:48,726 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:39:48,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:39:48 BoogieIcfgContainer [2025-03-04 07:39:48,726 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:39:48,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:39:48,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:39:48,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:39:48,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:39:47" (1/3) ... [2025-03-04 07:39:48,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1994c58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:39:48, skipping insertion in model container [2025-03-04 07:39:48,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:47" (2/3) ... [2025-03-04 07:39:48,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1994c58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:39:48, skipping insertion in model container [2025-03-04 07:39:48,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:39:48" (3/3) ... [2025-03-04 07:39:48,733 INFO L128 eAbstractionObserver]: Analyzing ICFG split_list_test05-1.i [2025-03-04 07:39:48,742 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:39:48,743 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG split_list_test05-1.i that has 2 procedures, 321 locations, 1 initial locations, 11 loop locations, and 147 error locations. [2025-03-04 07:39:48,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:39:48,786 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;@6c07ca08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:39:48,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2025-03-04 07:39:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 321 states, 158 states have (on average 2.1139240506329116) internal successors, (334), 307 states have internal predecessors, (334), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 07:39:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:39:48,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:48,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:39:48,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-04 07:39:48,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:48,801 INFO L85 PathProgramCache]: Analyzing trace with hash 332622, now seen corresponding path program 1 times [2025-03-04 07:39:48,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:48,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278246139] [2025-03-04 07:39:48,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:48,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:48,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:39:48,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:39:48,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:48,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:48,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:48,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:48,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278246139] [2025-03-04 07:39:48,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278246139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:39:48,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:39:48,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:39:48,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218088173] [2025-03-04 07:39:48,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:39:48,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:39:48,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:48,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:39:48,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:48,962 INFO L87 Difference]: Start difference. First operand has 321 states, 158 states have (on average 2.1139240506329116) internal successors, (334), 307 states have internal predecessors, (334), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:49,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:49,294 INFO L93 Difference]: Finished difference Result 545 states and 599 transitions. [2025-03-04 07:39:49,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:39:49,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2025-03-04 07:39:49,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:49,302 INFO L225 Difference]: With dead ends: 545 [2025-03-04 07:39:49,302 INFO L226 Difference]: Without dead ends: 543 [2025-03-04 07:39:49,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:49,305 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 243 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:49,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 443 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:39:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-04 07:39:49,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 405. [2025-03-04 07:39:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 245 states have (on average 2.0979591836734692) internal successors, (514), 391 states have internal predecessors, (514), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 07:39:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 542 transitions. [2025-03-04 07:39:49,364 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 542 transitions. Word has length 3 [2025-03-04 07:39:49,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:49,364 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 542 transitions. [2025-03-04 07:39:49,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:49,364 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 542 transitions. [2025-03-04 07:39:49,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:39:49,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:49,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:39:49,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:39:49,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr120REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-04 07:39:49,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:49,365 INFO L85 PathProgramCache]: Analyzing trace with hash 332623, now seen corresponding path program 1 times [2025-03-04 07:39:49,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:49,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548102610] [2025-03-04 07:39:49,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:49,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:49,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:39:49,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:39:49,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:49,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:49,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:49,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:49,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548102610] [2025-03-04 07:39:49,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548102610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:39:49,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:39:49,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:39:49,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946750932] [2025-03-04 07:39:49,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:39:49,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:39:49,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:49,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:39:49,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:49,448 INFO L87 Difference]: Start difference. First operand 405 states and 542 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:49,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:49,630 INFO L93 Difference]: Finished difference Result 406 states and 545 transitions. [2025-03-04 07:39:49,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:39:49,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2025-03-04 07:39:49,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:49,632 INFO L225 Difference]: With dead ends: 406 [2025-03-04 07:39:49,632 INFO L226 Difference]: Without dead ends: 406 [2025-03-04 07:39:49,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:49,633 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 6 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:49,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 561 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:39:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-04 07:39:49,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 403. [2025-03-04 07:39:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 245 states have (on average 2.089795918367347) internal successors, (512), 389 states have internal predecessors, (512), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 07:39:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 540 transitions. [2025-03-04 07:39:49,657 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 540 transitions. Word has length 3 [2025-03-04 07:39:49,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:49,657 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 540 transitions. [2025-03-04 07:39:49,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:49,657 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 540 transitions. [2025-03-04 07:39:49,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:39:49,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:49,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:39:49,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:39:49,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-04 07:39:49,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:49,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1963120433, now seen corresponding path program 1 times [2025-03-04 07:39:49,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:49,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927543143] [2025-03-04 07:39:49,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:49,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:49,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:39:49,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:39:49,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:49,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:49,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:49,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927543143] [2025-03-04 07:39:49,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927543143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:39:49,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:39:49,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:39:49,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20322401] [2025-03-04 07:39:49,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:39:49,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:39:49,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:49,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:39:49,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:49,745 INFO L87 Difference]: Start difference. First operand 403 states and 540 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:49,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:49,902 INFO L93 Difference]: Finished difference Result 398 states and 535 transitions. [2025-03-04 07:39:49,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:39:49,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 07:39:49,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:49,904 INFO L225 Difference]: With dead ends: 398 [2025-03-04 07:39:49,905 INFO L226 Difference]: Without dead ends: 398 [2025-03-04 07:39:49,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:49,906 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 35 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:49,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 508 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:39:49,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-04 07:39:49,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2025-03-04 07:39:49,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 245 states have (on average 2.0693877551020408) internal successors, (507), 384 states have internal predecessors, (507), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 07:39:49,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 535 transitions. [2025-03-04 07:39:49,923 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 535 transitions. Word has length 10 [2025-03-04 07:39:49,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:49,924 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 535 transitions. [2025-03-04 07:39:49,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:49,924 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 535 transitions. [2025-03-04 07:39:49,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:39:49,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:49,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:39:49,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:39:49,925 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-04 07:39:49,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:49,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1963120434, now seen corresponding path program 1 times [2025-03-04 07:39:49,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:49,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741171347] [2025-03-04 07:39:49,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:49,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:49,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:39:49,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:39:49,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:49,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:50,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:50,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:50,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741171347] [2025-03-04 07:39:50,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741171347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:39:50,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:39:50,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:39:50,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856223238] [2025-03-04 07:39:50,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:39:50,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:39:50,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:50,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:39:50,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:50,014 INFO L87 Difference]: Start difference. First operand 398 states and 535 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:50,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:50,159 INFO L93 Difference]: Finished difference Result 393 states and 530 transitions. [2025-03-04 07:39:50,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:39:50,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 07:39:50,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:50,161 INFO L225 Difference]: With dead ends: 393 [2025-03-04 07:39:50,161 INFO L226 Difference]: Without dead ends: 393 [2025-03-04 07:39:50,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:50,162 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 35 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:50,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 521 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:39:50,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-04 07:39:50,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-03-04 07:39:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 245 states have (on average 2.048979591836735) internal successors, (502), 379 states have internal predecessors, (502), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 07:39:50,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 530 transitions. [2025-03-04 07:39:50,179 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 530 transitions. Word has length 10 [2025-03-04 07:39:50,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:50,179 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 530 transitions. [2025-03-04 07:39:50,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:50,179 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 530 transitions. [2025-03-04 07:39:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:39:50,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:50,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:39:50,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:39:50,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-04 07:39:50,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:50,181 INFO L85 PathProgramCache]: Analyzing trace with hash 727191597, now seen corresponding path program 1 times [2025-03-04 07:39:50,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:50,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847029237] [2025-03-04 07:39:50,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:50,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:50,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:39:50,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:39:50,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:50,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:50,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:50,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847029237] [2025-03-04 07:39:50,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847029237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:39:50,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:39:50,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:39:50,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273177155] [2025-03-04 07:39:50,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:39:50,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:39:50,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:50,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:39:50,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:39:50,375 INFO L87 Difference]: Start difference. First operand 393 states and 530 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:50,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:50,878 INFO L93 Difference]: Finished difference Result 520 states and 572 transitions. [2025-03-04 07:39:50,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:39:50,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 07:39:50,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:50,881 INFO L225 Difference]: With dead ends: 520 [2025-03-04 07:39:50,882 INFO L226 Difference]: Without dead ends: 520 [2025-03-04 07:39:50,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:39:50,884 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 303 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:50,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 798 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:39:50,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-04 07:39:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 385. [2025-03-04 07:39:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 245 states have (on average 2.016326530612245) internal successors, (494), 371 states have internal predecessors, (494), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 07:39:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 522 transitions. [2025-03-04 07:39:50,896 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 522 transitions. Word has length 11 [2025-03-04 07:39:50,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:50,898 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 522 transitions. [2025-03-04 07:39:50,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 522 transitions. [2025-03-04 07:39:50,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:39:50,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:50,898 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:39:50,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:39:50,898 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-04 07:39:50,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:50,899 INFO L85 PathProgramCache]: Analyzing trace with hash 727191598, now seen corresponding path program 1 times [2025-03-04 07:39:50,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:50,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366861757] [2025-03-04 07:39:50,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:50,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:50,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:39:50,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:39:50,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:50,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:51,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:51,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:51,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366861757] [2025-03-04 07:39:51,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366861757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:39:51,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:39:51,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:39:51,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576865803] [2025-03-04 07:39:51,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:39:51,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:39:51,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:51,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:39:51,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:39:51,079 INFO L87 Difference]: Start difference. First operand 385 states and 522 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:51,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:51,620 INFO L93 Difference]: Finished difference Result 512 states and 563 transitions. [2025-03-04 07:39:51,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:39:51,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 07:39:51,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:51,623 INFO L225 Difference]: With dead ends: 512 [2025-03-04 07:39:51,624 INFO L226 Difference]: Without dead ends: 512 [2025-03-04 07:39:51,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:39:51,625 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 786 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:51,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 451 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:39:51,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-04 07:39:51,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 376. [2025-03-04 07:39:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 245 states have (on average 1.9755102040816326) internal successors, (484), 362 states have internal predecessors, (484), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 07:39:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 512 transitions. [2025-03-04 07:39:51,643 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 512 transitions. Word has length 11 [2025-03-04 07:39:51,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:51,643 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 512 transitions. [2025-03-04 07:39:51,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:51,643 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 512 transitions. [2025-03-04 07:39:51,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:39:51,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:51,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:39:51,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:39:51,644 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-04 07:39:51,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:51,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2023942815, now seen corresponding path program 1 times [2025-03-04 07:39:51,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:51,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826847778] [2025-03-04 07:39:51,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:51,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:51,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:39:51,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:39:51,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:51,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:51,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:51,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826847778] [2025-03-04 07:39:51,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826847778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:39:51,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:39:51,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:39:51,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742365558] [2025-03-04 07:39:51,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:39:51,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:39:51,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:51,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:39:51,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:39:51,892 INFO L87 Difference]: Start difference. First operand 376 states and 512 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:51,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:51,994 INFO L93 Difference]: Finished difference Result 398 states and 537 transitions. [2025-03-04 07:39:51,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:39:51,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 07:39:51,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:51,996 INFO L225 Difference]: With dead ends: 398 [2025-03-04 07:39:51,996 INFO L226 Difference]: Without dead ends: 398 [2025-03-04 07:39:51,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:39:51,997 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 35 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:51,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1849 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:39:51,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-04 07:39:52,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 384. [2025-03-04 07:39:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 252 states have (on average 1.9523809523809523) internal successors, (492), 369 states have internal predecessors, (492), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 07:39:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 522 transitions. [2025-03-04 07:39:52,009 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 522 transitions. Word has length 20 [2025-03-04 07:39:52,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:52,009 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 522 transitions. [2025-03-04 07:39:52,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:52,009 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 522 transitions. [2025-03-04 07:39:52,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:39:52,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:52,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:39:52,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:39:52,010 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-04 07:39:52,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:52,010 INFO L85 PathProgramCache]: Analyzing trace with hash 851821411, now seen corresponding path program 1 times [2025-03-04 07:39:52,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:52,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111593141] [2025-03-04 07:39:52,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:52,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:52,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:39:52,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:39:52,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:52,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:52,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:52,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:52,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111593141] [2025-03-04 07:39:52,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111593141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:39:52,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:39:52,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:39:52,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793266127] [2025-03-04 07:39:52,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:39:52,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:39:52,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:52,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:39:52,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:39:52,334 INFO L87 Difference]: Start difference. First operand 384 states and 522 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:52,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:52,501 INFO L93 Difference]: Finished difference Result 391 states and 528 transitions. [2025-03-04 07:39:52,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:39:52,504 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-04 07:39:52,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:52,505 INFO L225 Difference]: With dead ends: 391 [2025-03-04 07:39:52,505 INFO L226 Difference]: Without dead ends: 391 [2025-03-04 07:39:52,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:39:52,507 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 274 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:52,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1835 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:39:52,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-04 07:39:52,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 387. [2025-03-04 07:39:52,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 255 states have (on average 1.9411764705882353) internal successors, (495), 372 states have internal predecessors, (495), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 07:39:52,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 525 transitions. [2025-03-04 07:39:52,519 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 525 transitions. Word has length 22 [2025-03-04 07:39:52,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:52,519 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 525 transitions. [2025-03-04 07:39:52,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:52,519 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 525 transitions. [2025-03-04 07:39:52,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:39:52,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:52,520 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:39:52,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:39:52,521 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-04 07:39:52,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:52,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2072293493, now seen corresponding path program 1 times [2025-03-04 07:39:52,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:52,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75318517] [2025-03-04 07:39:52,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:52,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:52,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:39:52,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:39:52,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:52,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:53,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:53,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75318517] [2025-03-04 07:39:53,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75318517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:39:53,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803966354] [2025-03-04 07:39:53,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:53,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:39:53,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:39:53,031 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:39:53,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:39:53,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:39:53,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:39:53,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:53,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:53,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 07:39:53,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:39:53,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:39:53,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 07:39:53,308 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2025-03-04 07:39:53,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 28 [2025-03-04 07:39:53,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-04 07:39:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:53,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:39:53,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-03-04 07:39:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:54,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803966354] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:39:54,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:39:54,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 17 [2025-03-04 07:39:54,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428250906] [2025-03-04 07:39:54,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:39:54,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 07:39:54,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:54,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 07:39:54,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:39:54,038 INFO L87 Difference]: Start difference. First operand 387 states and 525 transitions. Second operand has 18 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:39:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:55,117 INFO L93 Difference]: Finished difference Result 528 states and 580 transitions. [2025-03-04 07:39:55,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:39:55,118 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-03-04 07:39:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:55,120 INFO L225 Difference]: With dead ends: 528 [2025-03-04 07:39:55,120 INFO L226 Difference]: Without dead ends: 528 [2025-03-04 07:39:55,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:39:55,121 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 585 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:55,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 1859 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1694 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 07:39:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-04 07:39:55,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 392. [2025-03-04 07:39:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 260 states have (on average 1.9192307692307693) internal successors, (499), 377 states have internal predecessors, (499), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 07:39:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 529 transitions. [2025-03-04 07:39:55,130 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 529 transitions. Word has length 37 [2025-03-04 07:39:55,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:55,130 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 529 transitions. [2025-03-04 07:39:55,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:39:55,130 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 529 transitions. [2025-03-04 07:39:55,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:39:55,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:55,131 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:39:55,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 07:39:55,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:39:55,335 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-04 07:39:55,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:55,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2072293492, now seen corresponding path program 1 times [2025-03-04 07:39:55,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:55,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464220699] [2025-03-04 07:39:55,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:55,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:55,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:39:55,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:39:55,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:55,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:56,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:56,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464220699] [2025-03-04 07:39:56,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464220699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:39:56,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884591100] [2025-03-04 07:39:56,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:56,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:39:56,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:39:56,468 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:39:56,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:39:56,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:39:56,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:39:56,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:56,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:56,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 07:39:56,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:39:56,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:39:56,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:39:56,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 07:39:56,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:39:56,814 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2025-03-04 07:39:56,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-03-04 07:39:56,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-04 07:39:56,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-04 07:39:56,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:56,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:39:57,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2025-03-04 07:39:57,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 94 [2025-03-04 07:39:57,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2025-03-04 07:39:57,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:57,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884591100] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:39:57,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:39:57,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 6, 6] total 28 [2025-03-04 07:39:57,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170150658] [2025-03-04 07:39:57,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:39:57,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 07:39:57,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:57,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 07:39:57,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2025-03-04 07:39:57,477 INFO L87 Difference]: Start difference. First operand 392 states and 529 transitions. Second operand has 29 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 27 states have internal predecessors, (93), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:39:59,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:59,984 INFO L93 Difference]: Finished difference Result 536 states and 589 transitions. [2025-03-04 07:39:59,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 07:39:59,985 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 27 states have internal predecessors, (93), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-03-04 07:39:59,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:59,989 INFO L225 Difference]: With dead ends: 536 [2025-03-04 07:39:59,989 INFO L226 Difference]: Without dead ends: 536 [2025-03-04 07:39:59,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=383, Invalid=1873, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 07:39:59,991 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1373 mSDsluCounter, 2177 mSDsCounter, 0 mSdLazyCounter, 4161 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 2317 SdHoareTripleChecker+Invalid, 4289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 4161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:59,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 2317 Invalid, 4289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 4161 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 07:39:59,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-04 07:39:59,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 391. [2025-03-04 07:39:59,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 260 states have (on average 1.9153846153846155) internal successors, (498), 376 states have internal predecessors, (498), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 07:40:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 528 transitions. [2025-03-04 07:40:00,001 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 528 transitions. Word has length 37 [2025-03-04 07:40:00,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:00,001 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 528 transitions. [2025-03-04 07:40:00,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 27 states have internal predecessors, (93), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:40:00,001 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 528 transitions. [2025-03-04 07:40:00,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-04 07:40:00,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:00,011 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:40:00,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:40:00,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 07:40:00,215 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-04 07:40:00,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:00,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1629612883, now seen corresponding path program 1 times [2025-03-04 07:40:00,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:00,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438452285] [2025-03-04 07:40:00,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:00,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:00,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-04 07:40:00,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-04 07:40:00,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:00,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 7 proven. 84 refuted. 0 times theorem prover too weak. 1001 trivial. 0 not checked. [2025-03-04 07:40:00,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:00,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438452285] [2025-03-04 07:40:00,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438452285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:00,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829848329] [2025-03-04 07:40:00,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:00,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:00,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:00,402 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:40:00,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:40:00,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-04 07:40:00,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-04 07:40:00,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:00,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:00,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 1971 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 07:40:00,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:40:00,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2025-03-04 07:40:00,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:40:00,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829848329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:40:00,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:40:00,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-03-04 07:40:00,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053090194] [2025-03-04 07:40:00,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:40:00,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:40:00,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:00,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:40:00,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:40:00,740 INFO L87 Difference]: Start difference. First operand 391 states and 528 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 07:40:00,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:00,749 INFO L93 Difference]: Finished difference Result 392 states and 529 transitions. [2025-03-04 07:40:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:40:00,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 204 [2025-03-04 07:40:00,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:00,751 INFO L225 Difference]: With dead ends: 392 [2025-03-04 07:40:00,751 INFO L226 Difference]: Without dead ends: 392 [2025-03-04 07:40:00,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:40:00,751 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 0 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:00,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 637 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:40:00,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-04 07:40:00,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-04 07:40:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 261 states have (on average 1.9118773946360152) internal successors, (499), 377 states have internal predecessors, (499), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 07:40:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 529 transitions. [2025-03-04 07:40:00,758 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 529 transitions. Word has length 204 [2025-03-04 07:40:00,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:00,759 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 529 transitions. [2025-03-04 07:40:00,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 07:40:00,759 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 529 transitions. [2025-03-04 07:40:00,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-04 07:40:00,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:00,760 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:40:00,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:40:00,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:00,961 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-04 07:40:00,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:00,962 INFO L85 PathProgramCache]: Analyzing trace with hash 513447313, now seen corresponding path program 1 times [2025-03-04 07:40:00,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:00,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263896263] [2025-03-04 07:40:00,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:00,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:01,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-04 07:40:01,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-04 07:40:01,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:01,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 1 proven. 337 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2025-03-04 07:40:02,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:02,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263896263] [2025-03-04 07:40:02,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263896263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:02,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182255334] [2025-03-04 07:40:02,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:02,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:02,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:02,018 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:40:02,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:40:02,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-04 07:40:02,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-04 07:40:02,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:02,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:02,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 07:40:02,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:40:02,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 07:40:02,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2025-03-04 07:40:22,665 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:40:22,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 07:40:22,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-04 07:40:26,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 878 proven. 39 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2025-03-04 07:40:26,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:40:34,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:40:34,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2025-03-04 07:40:35,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182255334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:35,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:40:35,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2025-03-04 07:40:35,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504310196] [2025-03-04 07:40:35,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:40:35,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 07:40:35,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:35,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 07:40:35,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=506, Unknown=15, NotChecked=0, Total=600 [2025-03-04 07:40:35,005 INFO L87 Difference]: Start difference. First operand 392 states and 529 transitions. Second operand has 21 states, 21 states have (on average 5.095238095238095) internal successors, (107), 20 states have internal predecessors, (107), 4 states have call successors, (27), 3 states have call predecessors, (27), 7 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-04 07:40:39,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:40:43,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:40:51,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:40:55,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:40:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:55,679 INFO L93 Difference]: Finished difference Result 387 states and 521 transitions. [2025-03-04 07:40:55,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 07:40:55,680 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.095238095238095) internal successors, (107), 20 states have internal predecessors, (107), 4 states have call successors, (27), 3 states have call predecessors, (27), 7 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 230 [2025-03-04 07:40:55,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:55,681 INFO L225 Difference]: With dead ends: 387 [2025-03-04 07:40:55,681 INFO L226 Difference]: Without dead ends: 387 [2025-03-04 07:40:55,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=279, Invalid=1266, Unknown=15, NotChecked=0, Total=1560 [2025-03-04 07:40:55,682 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 601 mSDsluCounter, 3857 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 85 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 4150 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:55,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 4150 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 742 Invalid, 5 Unknown, 0 Unchecked, 16.4s Time] [2025-03-04 07:40:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-04 07:40:55,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 385. [2025-03-04 07:40:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 254 states have (on average 1.9291338582677164) internal successors, (490), 370 states have internal predecessors, (490), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 07:40:55,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 520 transitions. [2025-03-04 07:40:55,690 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 520 transitions. Word has length 230 [2025-03-04 07:40:55,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:55,690 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 520 transitions. [2025-03-04 07:40:55,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.095238095238095) internal successors, (107), 20 states have internal predecessors, (107), 4 states have call successors, (27), 3 states have call predecessors, (27), 7 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-04 07:40:55,691 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 520 transitions. [2025-03-04 07:40:55,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-04 07:40:55,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:55,693 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:40:55,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 07:40:55,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:55,894 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 144 more)] === [2025-03-04 07:40:55,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:55,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1643149304, now seen corresponding path program 1 times [2025-03-04 07:40:55,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:55,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420336527] [2025-03-04 07:40:55,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:55,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:55,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-04 07:40:56,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-04 07:40:56,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:56,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:04,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 186 proven. 419 refuted. 0 times theorem prover too weak. 747 trivial. 0 not checked. [2025-03-04 07:41:04,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:04,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420336527] [2025-03-04 07:41:04,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420336527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:04,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908579779] [2025-03-04 07:41:04,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:04,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:04,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:04,860 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:04,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:41:05,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-04 07:41:05,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-04 07:41:05,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:05,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:05,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 2205 conjuncts, 273 conjuncts are in the unsatisfiable core [2025-03-04 07:41:05,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:05,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:41:05,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2025-03-04 07:41:05,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:41:05,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 16 [2025-03-04 07:41:05,741 INFO L349 Elim1Store]: treesize reduction 50, result has 32.4 percent of original size [2025-03-04 07:41:05,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 30 [2025-03-04 07:41:05,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2025-03-04 07:41:05,877 INFO L349 Elim1Store]: treesize reduction 50, result has 32.4 percent of original size [2025-03-04 07:41:05,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 30 [2025-03-04 07:41:05,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:41:05,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 27 [2025-03-04 07:41:05,978 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2025-03-04 07:41:05,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2025-03-04 07:41:05,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 17 [2025-03-04 07:41:06,107 INFO L349 Elim1Store]: treesize reduction 86, result has 37.2 percent of original size [2025-03-04 07:41:06,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 57 [2025-03-04 07:41:06,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:41:06,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 38 [2025-03-04 07:41:06,305 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2025-03-04 07:41:06,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2025-03-04 07:41:06,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:41:06,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 35 [2025-03-04 07:41:06,565 INFO L349 Elim1Store]: treesize reduction 66, result has 46.3 percent of original size [2025-03-04 07:41:06,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 91 [2025-03-04 07:41:06,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 49 [2025-03-04 07:41:06,799 INFO L349 Elim1Store]: treesize reduction 155, result has 40.6 percent of original size [2025-03-04 07:41:06,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 66 treesize of output 133 [2025-03-04 07:41:06,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 57 [2025-03-04 07:41:07,144 INFO L349 Elim1Store]: treesize reduction 128, result has 58.4 percent of original size [2025-03-04 07:41:07,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 237 [2025-03-04 07:41:07,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 95