./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:31:43,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:31:43,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:31:43,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:31:43,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:31:43,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:31:43,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:31:43,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:31:43,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:31:43,588 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:31:43,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:31:43,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:31:43,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:31:43,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:31:43,590 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:31:43,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:31:43,590 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:31:43,590 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:31:43,590 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:31:43,590 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:31:43,590 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:31:43,590 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:31:43,590 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:31:43,590 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:31:43,590 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:31:43,591 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:31:43,591 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:31:43,591 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:31:43,591 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:31:43,591 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:31:43,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:31:43,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:31:43,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:31:43,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:31:43,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:31:43,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:31:43,592 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:31:43,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:31:43,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:31:43,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:31:43,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:31:43,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:31:43,592 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 [2025-02-06 10:31:43,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:31:43,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:31:43,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:31:43,830 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:31:43,831 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:31:43,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2025-02-06 10:31:45,000 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/219562ab8/b0f7c1e269cc43ca8a6f10930cb338d2/FLAG0ef3d92f6 [2025-02-06 10:31:45,249 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:31:45,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2025-02-06 10:31:45,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/219562ab8/b0f7c1e269cc43ca8a6f10930cb338d2/FLAG0ef3d92f6 [2025-02-06 10:31:45,275 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/219562ab8/b0f7c1e269cc43ca8a6f10930cb338d2 [2025-02-06 10:31:45,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:31:45,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:31:45,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:31:45,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:31:45,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:31:45,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:31:45" (1/1) ... [2025-02-06 10:31:45,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21eb93b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:45, skipping insertion in model container [2025-02-06 10:31:45,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:31:45" (1/1) ... [2025-02-06 10:31:45,316 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:31:45,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:31:45,557 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:31:45,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:31:45,616 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:31:45,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:45 WrapperNode [2025-02-06 10:31:45,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:31:45,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:31:45,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:31:45,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:31:45,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:45" (1/1) ... [2025-02-06 10:31:45,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:45" (1/1) ... [2025-02-06 10:31:45,652 INFO L138 Inliner]: procedures = 129, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2025-02-06 10:31:45,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:31:45,652 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:31:45,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:31:45,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:31:45,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:45" (1/1) ... [2025-02-06 10:31:45,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:45" (1/1) ... [2025-02-06 10:31:45,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:45" (1/1) ... [2025-02-06 10:31:45,682 INFO L175 MemorySlicer]: Split 42 memory accesses to 5 slices as follows [2, 8, 18, 6, 8]. 43 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 0, 1, 0]. The 10 writes are split as follows [0, 1, 7, 1, 1]. [2025-02-06 10:31:45,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:45" (1/1) ... [2025-02-06 10:31:45,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:45" (1/1) ... [2025-02-06 10:31:45,691 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:45" (1/1) ... [2025-02-06 10:31:45,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:45" (1/1) ... [2025-02-06 10:31:45,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:45" (1/1) ... [2025-02-06 10:31:45,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:45" (1/1) ... [2025-02-06 10:31:45,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:31:45,699 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:31:45,699 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:31:45,699 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:31:45,700 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:45" (1/1) ... [2025-02-06 10:31:45,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:31:45,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:31:45,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:31:45,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:31:45,738 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-02-06 10:31:45,738 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-02-06 10:31:45,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:31:45,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:31:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:31:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:31:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:31:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 10:31:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 10:31:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 10:31:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:31:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:31:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 10:31:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 10:31:45,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 10:31:45,740 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2025-02-06 10:31:45,740 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2025-02-06 10:31:45,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:31:45,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 10:31:45,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 10:31:45,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 10:31:45,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 10:31:45,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-06 10:31:45,740 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2025-02-06 10:31:45,740 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2025-02-06 10:31:45,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:31:45,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:31:45,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 10:31:45,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 10:31:45,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 10:31:45,741 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2025-02-06 10:31:45,741 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2025-02-06 10:31:45,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:31:45,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:31:45,866 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:31:45,867 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:31:46,323 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L640: call ULTIMATE.dealloc(main_~#p1~0#1.base, main_~#p1~0#1.offset);havoc main_~#p1~0#1.base, main_~#p1~0#1.offset;call ULTIMATE.dealloc(main_~#p2~0#1.base, main_~#p2~0#1.offset);havoc main_~#p2~0#1.base, main_~#p2~0#1.offset; [2025-02-06 10:31:46,323 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L600: havoc create_sll_#t~mem11#1.base, create_sll_#t~mem11#1.offset;call ULTIMATE.dealloc(create_sll_~#list~0#1.base, create_sll_~#list~0#1.offset);havoc create_sll_~#list~0#1.base, create_sll_~#list~0#1.offset; [2025-02-06 10:31:46,355 INFO L? ?]: Removed 194 outVars from TransFormulas that were not future-live. [2025-02-06 10:31:46,355 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:31:46,367 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:31:46,367 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:31:46,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:31:46 BoogieIcfgContainer [2025-02-06 10:31:46,367 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:31:46,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:31:46,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:31:46,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:31:46,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:31:45" (1/3) ... [2025-02-06 10:31:46,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7729599d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:31:46, skipping insertion in model container [2025-02-06 10:31:46,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:31:45" (2/3) ... [2025-02-06 10:31:46,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7729599d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:31:46, skipping insertion in model container [2025-02-06 10:31:46,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:31:46" (3/3) ... [2025-02-06 10:31:46,376 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2025-02-06 10:31:46,387 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:31:46,388 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_to_dll_rev-2.i that has 5 procedures, 240 locations, 1 initial locations, 21 loop locations, and 83 error locations. [2025-02-06 10:31:46,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:31:46,432 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;@3d5365ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:31:46,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2025-02-06 10:31:46,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 135 states have (on average 1.962962962962963) internal successors, (265), 226 states have internal predecessors, (265), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 10:31:46,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:31:46,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:46,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:31:46,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-02-06 10:31:46,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:46,445 INFO L85 PathProgramCache]: Analyzing trace with hash 9726713, now seen corresponding path program 1 times [2025-02-06 10:31:46,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:46,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244268714] [2025-02-06 10:31:46,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:46,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:46,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:31:46,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:31:46,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:46,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:31:46,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:46,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244268714] [2025-02-06 10:31:46,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244268714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:46,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:46,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:31:46,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634214958] [2025-02-06 10:31:46,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:46,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 10:31:46,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:46,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 10:31:46,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:31:46,578 INFO L87 Difference]: Start difference. First operand has 240 states, 135 states have (on average 1.962962962962963) internal successors, (265), 226 states have internal predecessors, (265), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:31:46,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:46,601 INFO L93 Difference]: Finished difference Result 237 states and 258 transitions. [2025-02-06 10:31:46,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 10:31:46,603 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-02-06 10:31:46,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:46,608 INFO L225 Difference]: With dead ends: 237 [2025-02-06 10:31:46,608 INFO L226 Difference]: Without dead ends: 235 [2025-02-06 10:31:46,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:31:46,611 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:46,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:31:46,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-02-06 10:31:46,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2025-02-06 10:31:46,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 132 states have (on average 1.7424242424242424) internal successors, (230), 221 states have internal predecessors, (230), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 10:31:46,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 256 transitions. [2025-02-06 10:31:46,664 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 256 transitions. Word has length 4 [2025-02-06 10:31:46,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:46,665 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 256 transitions. [2025-02-06 10:31:46,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:31:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 256 transitions. [2025-02-06 10:31:46,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:31:46,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:46,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:31:46,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:31:46,666 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting chain_nodeErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-02-06 10:31:46,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:46,667 INFO L85 PathProgramCache]: Analyzing trace with hash 2006076461, now seen corresponding path program 1 times [2025-02-06 10:31:46,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:46,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831310276] [2025-02-06 10:31:46,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:46,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:46,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:31:46,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:31:46,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:46,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:31:46,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:46,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831310276] [2025-02-06 10:31:46,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831310276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:46,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:46,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:31:46,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031961076] [2025-02-06 10:31:46,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:46,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:31:46,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:46,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:31:46,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:31:46,775 INFO L87 Difference]: Start difference. First operand 235 states and 256 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02-06 10:31:46,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:46,906 INFO L93 Difference]: Finished difference Result 233 states and 254 transitions. [2025-02-06 10:31:46,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:31:46,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-02-06 10:31:46,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:46,909 INFO L225 Difference]: With dead ends: 233 [2025-02-06 10:31:46,909 INFO L226 Difference]: Without dead ends: 233 [2025-02-06 10:31:46,909 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-02-06 10:31:46,910 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 2 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:46,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 413 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:31:46,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-06 10:31:46,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2025-02-06 10:31:46,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 132 states have (on average 1.7272727272727273) internal successors, (228), 219 states have internal predecessors, (228), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 10:31:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 254 transitions. [2025-02-06 10:31:46,927 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 254 transitions. Word has length 7 [2025-02-06 10:31:46,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:46,928 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 254 transitions. [2025-02-06 10:31:46,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02-06 10:31:46,928 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 254 transitions. [2025-02-06 10:31:46,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:31:46,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:46,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:31:46,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:31:46,929 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting chain_nodeErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-02-06 10:31:46,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:46,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2006076462, now seen corresponding path program 1 times [2025-02-06 10:31:46,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:46,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546966320] [2025-02-06 10:31:46,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:46,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:46,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:31:46,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:31:46,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:46,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:31:47,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:47,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546966320] [2025-02-06 10:31:47,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546966320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:47,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:47,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:31:47,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739846557] [2025-02-06 10:31:47,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:47,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:31:47,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:47,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:31:47,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:31:47,037 INFO L87 Difference]: Start difference. First operand 233 states and 254 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02-06 10:31:47,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:47,136 INFO L93 Difference]: Finished difference Result 231 states and 252 transitions. [2025-02-06 10:31:47,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:31:47,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-02-06 10:31:47,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:47,137 INFO L225 Difference]: With dead ends: 231 [2025-02-06 10:31:47,137 INFO L226 Difference]: Without dead ends: 231 [2025-02-06 10:31:47,138 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-02-06 10:31:47,138 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 2 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:47,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 418 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:31:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-06 10:31:47,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-02-06 10:31:47,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 132 states have (on average 1.7121212121212122) internal successors, (226), 217 states have internal predecessors, (226), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 10:31:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 252 transitions. [2025-02-06 10:31:47,152 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 252 transitions. Word has length 7 [2025-02-06 10:31:47,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:47,152 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 252 transitions. [2025-02-06 10:31:47,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02-06 10:31:47,152 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 252 transitions. [2025-02-06 10:31:47,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:31:47,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:47,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:31:47,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:31:47,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting chain_nodeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-02-06 10:31:47,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:47,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1879151287, now seen corresponding path program 1 times [2025-02-06 10:31:47,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:47,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787887316] [2025-02-06 10:31:47,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:47,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:47,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:31:47,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:31:47,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:47,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:47,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:31:47,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:47,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787887316] [2025-02-06 10:31:47,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787887316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:47,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:47,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:31:47,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039674122] [2025-02-06 10:31:47,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:47,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:31:47,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:47,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:31:47,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:31:47,332 INFO L87 Difference]: Start difference. First operand 231 states and 252 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-02-06 10:31:47,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:47,579 INFO L93 Difference]: Finished difference Result 226 states and 247 transitions. [2025-02-06 10:31:47,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:31:47,579 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-02-06 10:31:47,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:47,580 INFO L225 Difference]: With dead ends: 226 [2025-02-06 10:31:47,580 INFO L226 Difference]: Without dead ends: 226 [2025-02-06 10:31:47,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-02-06 10:31:47,581 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 42 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:47,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 819 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:31:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-02-06 10:31:47,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2025-02-06 10:31:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 212 states have internal predecessors, (221), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 10:31:47,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 247 transitions. [2025-02-06 10:31:47,594 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 247 transitions. Word has length 11 [2025-02-06 10:31:47,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:47,595 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 247 transitions. [2025-02-06 10:31:47,595 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-02-06 10:31:47,595 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 247 transitions. [2025-02-06 10:31:47,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:31:47,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:47,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:31:47,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:31:47,596 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting chain_nodeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-02-06 10:31:47,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:47,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1879151286, now seen corresponding path program 1 times [2025-02-06 10:31:47,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:47,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891193085] [2025-02-06 10:31:47,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:47,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:47,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:31:47,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:31:47,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:47,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:47,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:31:47,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:47,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891193085] [2025-02-06 10:31:47,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891193085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:47,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:47,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:31:47,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094387004] [2025-02-06 10:31:47,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:47,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:31:47,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:47,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:31:47,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:31:47,744 INFO L87 Difference]: Start difference. First operand 226 states and 247 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-02-06 10:31:47,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:47,956 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2025-02-06 10:31:47,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:31:47,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-02-06 10:31:47,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:47,961 INFO L225 Difference]: With dead ends: 221 [2025-02-06 10:31:47,962 INFO L226 Difference]: Without dead ends: 221 [2025-02-06 10:31:47,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:31:47,962 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 38 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:47,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 607 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:31:47,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-02-06 10:31:47,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2025-02-06 10:31:47,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 132 states have (on average 1.6363636363636365) internal successors, (216), 207 states have internal predecessors, (216), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 10:31:47,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 242 transitions. [2025-02-06 10:31:47,974 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 242 transitions. Word has length 11 [2025-02-06 10:31:47,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:47,975 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 242 transitions. [2025-02-06 10:31:47,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-02-06 10:31:47,975 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 242 transitions. [2025-02-06 10:31:47,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:31:47,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:47,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:31:47,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:31:47,975 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-02-06 10:31:47,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:47,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1875852221, now seen corresponding path program 1 times [2025-02-06 10:31:47,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:47,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339537256] [2025-02-06 10:31:47,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:47,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:47,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:31:47,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:31:47,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:47,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:48,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:31:48,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:48,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339537256] [2025-02-06 10:31:48,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339537256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:48,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:48,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:31:48,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996704594] [2025-02-06 10:31:48,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:48,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:31:48,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:48,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:31:48,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:31:48,048 INFO L87 Difference]: Start difference. First operand 221 states and 242 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-02-06 10:31:48,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:48,193 INFO L93 Difference]: Finished difference Result 220 states and 241 transitions. [2025-02-06 10:31:48,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:31:48,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 12 [2025-02-06 10:31:48,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:48,194 INFO L225 Difference]: With dead ends: 220 [2025-02-06 10:31:48,194 INFO L226 Difference]: Without dead ends: 220 [2025-02-06 10:31:48,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:31:48,195 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 3 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:48,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 708 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:31:48,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-06 10:31:48,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-02-06 10:31:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 132 states have (on average 1.628787878787879) internal successors, (215), 206 states have internal predecessors, (215), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 10:31:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 241 transitions. [2025-02-06 10:31:48,202 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 241 transitions. Word has length 12 [2025-02-06 10:31:48,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:48,202 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 241 transitions. [2025-02-06 10:31:48,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-02-06 10:31:48,202 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 241 transitions. [2025-02-06 10:31:48,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:31:48,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:48,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:31:48,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:31:48,203 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting chain_nodeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-02-06 10:31:48,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1875852222, now seen corresponding path program 1 times [2025-02-06 10:31:48,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:48,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398676795] [2025-02-06 10:31:48,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:48,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:48,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:31:48,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:31:48,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:48,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:31:48,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:48,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398676795] [2025-02-06 10:31:48,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398676795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:48,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:48,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:31:48,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50023149] [2025-02-06 10:31:48,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:48,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:31:48,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:48,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:31:48,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:31:48,294 INFO L87 Difference]: Start difference. First operand 220 states and 241 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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-02-06 10:31:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:48,419 INFO L93 Difference]: Finished difference Result 219 states and 240 transitions. [2025-02-06 10:31:48,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:31:48,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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 12 [2025-02-06 10:31:48,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:48,420 INFO L225 Difference]: With dead ends: 219 [2025-02-06 10:31:48,420 INFO L226 Difference]: Without dead ends: 219 [2025-02-06 10:31:48,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:31:48,420 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 4 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:48,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 790 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:31:48,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-06 10:31:48,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-02-06 10:31:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 132 states have (on average 1.621212121212121) internal successors, (214), 205 states have internal predecessors, (214), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 10:31:48,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 240 transitions. [2025-02-06 10:31:48,425 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 240 transitions. Word has length 12 [2025-02-06 10:31:48,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:48,426 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 240 transitions. [2025-02-06 10:31:48,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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-02-06 10:31:48,426 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 240 transitions. [2025-02-06 10:31:48,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 10:31:48,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:48,426 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-02-06 10:31:48,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:31:48,427 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-02-06 10:31:48,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:48,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1208178337, now seen corresponding path program 1 times [2025-02-06 10:31:48,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:48,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385572998] [2025-02-06 10:31:48,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:48,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:48,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:31:48,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:31:48,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:48,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:31:48,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:48,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385572998] [2025-02-06 10:31:48,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385572998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:48,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:48,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:31:48,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572276725] [2025-02-06 10:31:48,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:48,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:31:48,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:48,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:31:48,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:31:48,646 INFO L87 Difference]: Start difference. First operand 219 states and 240 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:31:48,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:48,942 INFO L93 Difference]: Finished difference Result 218 states and 239 transitions. [2025-02-06 10:31:48,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:31:48,943 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-02-06 10:31:48,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:48,944 INFO L225 Difference]: With dead ends: 218 [2025-02-06 10:31:48,944 INFO L226 Difference]: Without dead ends: 218 [2025-02-06 10:31:48,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:31:48,945 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 115 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:48,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 446 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:31:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-06 10:31:48,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-06 10:31:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 132 states have (on average 1.6136363636363635) internal successors, (213), 204 states have internal predecessors, (213), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 10:31:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 239 transitions. [2025-02-06 10:31:48,949 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 239 transitions. Word has length 20 [2025-02-06 10:31:48,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:48,950 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 239 transitions. [2025-02-06 10:31:48,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:31:48,950 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 239 transitions. [2025-02-06 10:31:48,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 10:31:48,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:48,951 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-02-06 10:31:48,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:31:48,951 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-02-06 10:31:48,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:48,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1208178338, now seen corresponding path program 1 times [2025-02-06 10:31:48,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:48,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909201587] [2025-02-06 10:31:48,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:48,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:48,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:31:48,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:31:48,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:48,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:31:49,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:49,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909201587] [2025-02-06 10:31:49,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909201587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:49,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:31:49,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:31:49,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815047892] [2025-02-06 10:31:49,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:49,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:31:49,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:49,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:31:49,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:31:49,172 INFO L87 Difference]: Start difference. First operand 218 states and 239 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:31:49,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:49,530 INFO L93 Difference]: Finished difference Result 219 states and 241 transitions. [2025-02-06 10:31:49,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:31:49,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-02-06 10:31:49,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:49,533 INFO L225 Difference]: With dead ends: 219 [2025-02-06 10:31:49,533 INFO L226 Difference]: Without dead ends: 219 [2025-02-06 10:31:49,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:31:49,534 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 59 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:49,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 655 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:31:49,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-06 10:31:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2025-02-06 10:31:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 132 states have (on average 1.606060606060606) internal successors, (212), 203 states have internal predecessors, (212), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 10:31:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 238 transitions. [2025-02-06 10:31:49,542 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 238 transitions. Word has length 20 [2025-02-06 10:31:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:49,542 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 238 transitions. [2025-02-06 10:31:49,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:31:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 238 transitions. [2025-02-06 10:31:49,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:31:49,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:49,544 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:31:49,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:31:49,544 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-02-06 10:31:49,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:49,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1000452166, now seen corresponding path program 1 times [2025-02-06 10:31:49,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:49,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966063954] [2025-02-06 10:31:49,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:49,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:49,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:31:49,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:31:49,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:49,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:49,975 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:31:49,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:49,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966063954] [2025-02-06 10:31:49,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966063954] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:31:49,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798632892] [2025-02-06 10:31:49,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:49,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:31:49,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:31:49,978 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:31:49,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:31:50,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:31:50,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:31:50,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:50,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:50,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 10:31:50,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:31:50,149 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-02-06 10:31:50,149 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 26 treesize of output 17 [2025-02-06 10:31:50,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:50,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:50,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 1 [2025-02-06 10:31:50,185 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (= (select |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base|) 0) (= |c_#valid| (store |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#valid| |chain_node_alloc_node_~ptr~0#1.base|))))) is different from true [2025-02-06 10:31:50,279 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-02-06 10:31:50,279 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 23 treesize of output 28 [2025-02-06 10:31:50,359 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1))) is different from true [2025-02-06 10:31:50,375 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2025-02-06 10:31:50,376 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 16 treesize of output 22 [2025-02-06 10:31:50,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2025-02-06 10:31:50,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:31:50,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798632892] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:31:50,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:31:50,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2025-02-06 10:31:50,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747920723] [2025-02-06 10:31:50,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:31:50,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 10:31:50,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:50,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 10:31:50,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=336, Unknown=2, NotChecked=78, Total=506 [2025-02-06 10:31:50,785 INFO L87 Difference]: Start difference. First operand 217 states and 238 transitions. Second operand has 16 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:31:51,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:51,587 INFO L93 Difference]: Finished difference Result 216 states and 237 transitions. [2025-02-06 10:31:51,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:31:51,588 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2025-02-06 10:31:51,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:51,589 INFO L225 Difference]: With dead ends: 216 [2025-02-06 10:31:51,589 INFO L226 Difference]: Without dead ends: 216 [2025-02-06 10:31:51,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=556, Unknown=2, NotChecked=102, Total=812 [2025-02-06 10:31:51,590 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 184 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 1658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 459 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:51,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1033 Invalid, 1658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1154 Invalid, 0 Unknown, 459 Unchecked, 0.6s Time] [2025-02-06 10:31:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-06 10:31:51,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2025-02-06 10:31:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 132 states have (on average 1.5984848484848484) internal successors, (211), 202 states have internal predecessors, (211), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 10:31:51,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 237 transitions. [2025-02-06 10:31:51,596 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 237 transitions. Word has length 39 [2025-02-06 10:31:51,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:51,597 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 237 transitions. [2025-02-06 10:31:51,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:31:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 237 transitions. [2025-02-06 10:31:51,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:31:51,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:51,599 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:31:51,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:31:51,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 10:31:51,800 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-02-06 10:31:51,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:51,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1000452165, now seen corresponding path program 1 times [2025-02-06 10:31:51,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:51,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368575808] [2025-02-06 10:31:51,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:51,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:51,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:31:51,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:31:51,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:51,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:52,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:31:52,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:52,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368575808] [2025-02-06 10:31:52,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368575808] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:31:52,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636657378] [2025-02-06 10:31:52,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:52,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:31:52,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:31:52,408 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:31:52,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:31:52,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:31:52,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:31:52,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:52,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:52,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-06 10:31:52,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:31:52,555 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-02-06 10:31:52,555 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 2 case distinctions, treesize of input 12 treesize of output 16 [2025-02-06 10:31:52,600 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-02-06 10:31:52,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 10 [2025-02-06 10:31:52,756 WARN L851 $PredicateComparison]: unable to prove that (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= |c_ULTIMATE.start_create_sll_~pp1#1.offset| 0) (or (exists ((|ULTIMATE.start_main_~#p2~0#1.base| Int) (|v_#length_BEFORE_CALL_2| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_2| |c_#length|))) (and (= (select |v_#length_BEFORE_CALL_2| |ULTIMATE.start_main_~#p2~0#1.base|) 4) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_2| .cse0 (select |c_#length| .cse0))) (= 4 (select |v_#length_BEFORE_CALL_2| |c_ULTIMATE.start_create_sll_~#list~0#1.base|)) (= (select |v_#length_BEFORE_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 4)))) (and (= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (exists ((|ULTIMATE.start_main_~#p2~0#1.base| Int)) (= (select |c_#length| |ULTIMATE.start_main_~#p2~0#1.base|) 4)) (= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~#list~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~#list~0#1.base|) 1)) is different from false [2025-02-06 10:31:52,758 WARN L873 $PredicateComparison]: unable to prove that (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= |c_ULTIMATE.start_create_sll_~pp1#1.offset| 0) (or (exists ((|ULTIMATE.start_main_~#p2~0#1.base| Int) (|v_#length_BEFORE_CALL_2| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_2| |c_#length|))) (and (= (select |v_#length_BEFORE_CALL_2| |ULTIMATE.start_main_~#p2~0#1.base|) 4) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_2| .cse0 (select |c_#length| .cse0))) (= 4 (select |v_#length_BEFORE_CALL_2| |c_ULTIMATE.start_create_sll_~#list~0#1.base|)) (= (select |v_#length_BEFORE_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 4)))) (and (= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (exists ((|ULTIMATE.start_main_~#p2~0#1.base| Int)) (= (select |c_#length| |ULTIMATE.start_main_~#p2~0#1.base|) 4)) (= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~#list~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~#list~0#1.base|) 1)) is different from true [2025-02-06 10:31:52,934 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 5 treesize of output 3 [2025-02-06 10:31:52,940 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-02-06 10:31:52,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 10 [2025-02-06 10:31:52,998 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int)) (and (= |c_#length| (store |c_old(#length)| |chain_node_~node~0#1.base| (select |c_#length| |chain_node_~node~0#1.base|))) (<= (+ |chain_node_~node~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2025-02-06 10:31:53,059 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:31:53,059 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 11 treesize of output 11 [2025-02-06 10:31:53,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:53,075 INFO L349 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2025-02-06 10:31:53,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 29 [2025-02-06 10:31:53,149 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_create_sll_~pp1#1.offset| 0) (or (and (= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (exists ((|ULTIMATE.start_create_sll_~#list~0#1.base| Int)) (= (select |c_#length| |ULTIMATE.start_create_sll_~#list~0#1.base|) 4))) (exists ((|chain_node_~node~0#1.base| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int)) (and (<= (+ 2 |chain_node_~node~0#1.base|) |c_ULTIMATE.start_create_sll_~pp1#1.base|) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |chain_node_~node~0#1.base|)) (exists ((|ULTIMATE.start_main_~#p2~0#1.base| Int) (|v_old(#length)_AFTER_CALL_4| (Array Int Int)) (|v_#length_BEFORE_CALL_2| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_2| |v_old(#length)_AFTER_CALL_4|))) (and (= (select |v_#length_BEFORE_CALL_2| |ULTIMATE.start_create_sll_~#list~0#1.base|) 4) (= |c_#length| (store |v_old(#length)_AFTER_CALL_4| |chain_node_~node~0#1.base| (select |c_#length| |chain_node_~node~0#1.base|))) (<= (+ .cse0 2) |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= (select |v_#length_BEFORE_CALL_2| |ULTIMATE.start_main_~#p2~0#1.base|) 4) (= |v_old(#length)_AFTER_CALL_4| (store |v_#length_BEFORE_CALL_2| .cse0 (select |v_old(#length)_AFTER_CALL_4| .cse0))) (= (select |v_#length_BEFORE_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 4)))))))) is different from false [2025-02-06 10:31:53,151 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_create_sll_~pp1#1.offset| 0) (or (and (= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (exists ((|ULTIMATE.start_create_sll_~#list~0#1.base| Int)) (= (select |c_#length| |ULTIMATE.start_create_sll_~#list~0#1.base|) 4))) (exists ((|chain_node_~node~0#1.base| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int)) (and (<= (+ 2 |chain_node_~node~0#1.base|) |c_ULTIMATE.start_create_sll_~pp1#1.base|) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |chain_node_~node~0#1.base|)) (exists ((|ULTIMATE.start_main_~#p2~0#1.base| Int) (|v_old(#length)_AFTER_CALL_4| (Array Int Int)) (|v_#length_BEFORE_CALL_2| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_2| |v_old(#length)_AFTER_CALL_4|))) (and (= (select |v_#length_BEFORE_CALL_2| |ULTIMATE.start_create_sll_~#list~0#1.base|) 4) (= |c_#length| (store |v_old(#length)_AFTER_CALL_4| |chain_node_~node~0#1.base| (select |c_#length| |chain_node_~node~0#1.base|))) (<= (+ .cse0 2) |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= (select |v_#length_BEFORE_CALL_2| |ULTIMATE.start_main_~#p2~0#1.base|) 4) (= |v_old(#length)_AFTER_CALL_4| (store |v_#length_BEFORE_CALL_2| .cse0 (select |v_old(#length)_AFTER_CALL_4| .cse0))) (= (select |v_#length_BEFORE_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 4)))))))) is different from true [2025-02-06 10:31:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-06 10:31:53,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:31:53,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636657378] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:31:53,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:31:53,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2025-02-06 10:31:53,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136830004] [2025-02-06 10:31:53,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:31:53,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 10:31:53,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:53,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 10:31:53,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=244, Unknown=5, NotChecked=102, Total=420 [2025-02-06 10:31:53,345 INFO L87 Difference]: Start difference. First operand 216 states and 237 transitions. Second operand has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 17 states have internal predecessors, (68), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:31:53,538 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (.cse2 (exists ((|ULTIMATE.start_main_~#p2~0#1.base| Int)) (= (select |c_#length| |ULTIMATE.start_main_~#p2~0#1.base|) 4))) (.cse4 (= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~#list~0#1.base|)))) (and (<= .cse0 |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= |c_ULTIMATE.start_create_sll_~pp1#1.offset| 0) .cse1 (<= .cse0 |c_ULTIMATE.start_create_sll_~#list~0#1.base|) .cse2 (or (exists ((|ULTIMATE.start_main_~#p2~0#1.base| Int) (|v_#length_BEFORE_CALL_2| (Array Int Int))) (let ((.cse3 (@diff |v_#length_BEFORE_CALL_2| |c_#length|))) (and (= (select |v_#length_BEFORE_CALL_2| |ULTIMATE.start_main_~#p2~0#1.base|) 4) (<= (+ .cse3 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_2| .cse3 (select |c_#length| .cse3))) (= 4 (select |v_#length_BEFORE_CALL_2| |c_ULTIMATE.start_create_sll_~#list~0#1.base|)) (= (select |v_#length_BEFORE_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 4)))) (and .cse1 .cse2 .cse4)) (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~#list~0#1.base|) 1) .cse4)) is different from false [2025-02-06 10:31:53,539 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (.cse2 (exists ((|ULTIMATE.start_main_~#p2~0#1.base| Int)) (= (select |c_#length| |ULTIMATE.start_main_~#p2~0#1.base|) 4))) (.cse4 (= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~#list~0#1.base|)))) (and (<= .cse0 |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= |c_ULTIMATE.start_create_sll_~pp1#1.offset| 0) .cse1 (<= .cse0 |c_ULTIMATE.start_create_sll_~#list~0#1.base|) .cse2 (or (exists ((|ULTIMATE.start_main_~#p2~0#1.base| Int) (|v_#length_BEFORE_CALL_2| (Array Int Int))) (let ((.cse3 (@diff |v_#length_BEFORE_CALL_2| |c_#length|))) (and (= (select |v_#length_BEFORE_CALL_2| |ULTIMATE.start_main_~#p2~0#1.base|) 4) (<= (+ .cse3 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_2| .cse3 (select |c_#length| .cse3))) (= 4 (select |v_#length_BEFORE_CALL_2| |c_ULTIMATE.start_create_sll_~#list~0#1.base|)) (= (select |v_#length_BEFORE_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 4)))) (and .cse1 .cse2 .cse4)) (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~#list~0#1.base|) 1) .cse4)) is different from true [2025-02-06 10:31:53,542 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~pp1#1.base|)))) (and (<= .cse0 |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= |c_ULTIMATE.start_create_sll_~pp1#1.offset| 0) .cse1 (<= .cse0 |c_ULTIMATE.start_create_sll_~#list~0#1.base|) (or (exists ((|ULTIMATE.start_main_~#p2~0#1.base| Int) (|v_#length_BEFORE_CALL_2| (Array Int Int))) (let ((.cse2 (@diff |v_#length_BEFORE_CALL_2| |c_#length|))) (and (= (select |v_#length_BEFORE_CALL_2| |ULTIMATE.start_main_~#p2~0#1.base|) 4) (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_2| .cse2 (select |c_#length| .cse2))) (= 4 (select |v_#length_BEFORE_CALL_2| |c_ULTIMATE.start_create_sll_~#list~0#1.base|)) (= (select |v_#length_BEFORE_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 4)))) (and .cse1 (exists ((|ULTIMATE.start_main_~#p2~0#1.base| Int)) (= (select |c_#length| |ULTIMATE.start_main_~#p2~0#1.base|) 4)) (= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~#list~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~#list~0#1.base|) 1))) is different from false [2025-02-06 10:31:53,543 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~pp1#1.base|)))) (and (<= .cse0 |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= |c_ULTIMATE.start_create_sll_~pp1#1.offset| 0) .cse1 (<= .cse0 |c_ULTIMATE.start_create_sll_~#list~0#1.base|) (or (exists ((|ULTIMATE.start_main_~#p2~0#1.base| Int) (|v_#length_BEFORE_CALL_2| (Array Int Int))) (let ((.cse2 (@diff |v_#length_BEFORE_CALL_2| |c_#length|))) (and (= (select |v_#length_BEFORE_CALL_2| |ULTIMATE.start_main_~#p2~0#1.base|) 4) (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_2| .cse2 (select |c_#length| .cse2))) (= 4 (select |v_#length_BEFORE_CALL_2| |c_ULTIMATE.start_create_sll_~#list~0#1.base|)) (= (select |v_#length_BEFORE_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 4)))) (and .cse1 (exists ((|ULTIMATE.start_main_~#p2~0#1.base| Int)) (= (select |c_#length| |ULTIMATE.start_main_~#p2~0#1.base|) 4)) (= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~#list~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~#list~0#1.base|) 1))) is different from true [2025-02-06 10:31:53,551 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~pp1#1.base|)))) (and (= |c_ULTIMATE.start_create_sll_~pp1#1.offset| 0) .cse0 (or (and .cse0 (exists ((|ULTIMATE.start_create_sll_~#list~0#1.base| Int)) (= (select |c_#length| |ULTIMATE.start_create_sll_~#list~0#1.base|) 4))) (exists ((|chain_node_~node~0#1.base| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int)) (and (<= (+ 2 |chain_node_~node~0#1.base|) |c_ULTIMATE.start_create_sll_~pp1#1.base|) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |chain_node_~node~0#1.base|)) (exists ((|ULTIMATE.start_main_~#p2~0#1.base| Int) (|v_old(#length)_AFTER_CALL_4| (Array Int Int)) (|v_#length_BEFORE_CALL_2| (Array Int Int))) (let ((.cse1 (@diff |v_#length_BEFORE_CALL_2| |v_old(#length)_AFTER_CALL_4|))) (and (= (select |v_#length_BEFORE_CALL_2| |ULTIMATE.start_create_sll_~#list~0#1.base|) 4) (= |c_#length| (store |v_old(#length)_AFTER_CALL_4| |chain_node_~node~0#1.base| (select |c_#length| |chain_node_~node~0#1.base|))) (<= (+ .cse1 2) |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= (select |v_#length_BEFORE_CALL_2| |ULTIMATE.start_main_~#p2~0#1.base|) 4) (= |v_old(#length)_AFTER_CALL_4| (store |v_#length_BEFORE_CALL_2| .cse1 (select |v_old(#length)_AFTER_CALL_4| .cse1))) (= (select |v_#length_BEFORE_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 4))))))))) is different from false [2025-02-06 10:31:53,553 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= 4 (select |c_#length| |c_ULTIMATE.start_create_sll_~pp1#1.base|)))) (and (= |c_ULTIMATE.start_create_sll_~pp1#1.offset| 0) .cse0 (or (and .cse0 (exists ((|ULTIMATE.start_create_sll_~#list~0#1.base| Int)) (= (select |c_#length| |ULTIMATE.start_create_sll_~#list~0#1.base|) 4))) (exists ((|chain_node_~node~0#1.base| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int)) (and (<= (+ 2 |chain_node_~node~0#1.base|) |c_ULTIMATE.start_create_sll_~pp1#1.base|) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |chain_node_~node~0#1.base|)) (exists ((|ULTIMATE.start_main_~#p2~0#1.base| Int) (|v_old(#length)_AFTER_CALL_4| (Array Int Int)) (|v_#length_BEFORE_CALL_2| (Array Int Int))) (let ((.cse1 (@diff |v_#length_BEFORE_CALL_2| |v_old(#length)_AFTER_CALL_4|))) (and (= (select |v_#length_BEFORE_CALL_2| |ULTIMATE.start_create_sll_~#list~0#1.base|) 4) (= |c_#length| (store |v_old(#length)_AFTER_CALL_4| |chain_node_~node~0#1.base| (select |c_#length| |chain_node_~node~0#1.base|))) (<= (+ .cse1 2) |c_ULTIMATE.start_create_sll_~pp1#1.base|) (= (select |v_#length_BEFORE_CALL_2| |ULTIMATE.start_main_~#p2~0#1.base|) 4) (= |v_old(#length)_AFTER_CALL_4| (store |v_#length_BEFORE_CALL_2| .cse1 (select |v_old(#length)_AFTER_CALL_4| .cse1))) (= (select |v_#length_BEFORE_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 4))))))))) is different from true [2025-02-06 10:31:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:54,223 INFO L93 Difference]: Finished difference Result 229 states and 254 transitions. [2025-02-06 10:31:54,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:31:54,224 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 17 states have internal predecessors, (68), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 39 [2025-02-06 10:31:54,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:54,225 INFO L225 Difference]: With dead ends: 229 [2025-02-06 10:31:54,225 INFO L226 Difference]: Without dead ends: 229 [2025-02-06 10:31:54,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=408, Unknown=11, NotChecked=282, Total=812 [2025-02-06 10:31:54,226 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 57 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 2188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 943 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:54,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 896 Invalid, 2188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1233 Invalid, 0 Unknown, 943 Unchecked, 0.7s Time] [2025-02-06 10:31:54,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-06 10:31:54,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2025-02-06 10:31:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 143 states have (on average 1.5664335664335665) internal successors, (224), 213 states have internal predecessors, (224), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 10:31:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 254 transitions. [2025-02-06 10:31:54,231 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 254 transitions. Word has length 39 [2025-02-06 10:31:54,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:54,231 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 254 transitions. [2025-02-06 10:31:54,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 17 states have internal predecessors, (68), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:31:54,231 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 254 transitions. [2025-02-06 10:31:54,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 10:31:54,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:54,232 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:31:54,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:31:54,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:31:54,434 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-02-06 10:31:54,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:54,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1091971993, now seen corresponding path program 1 times [2025-02-06 10:31:54,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:54,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929604451] [2025-02-06 10:31:54,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:54,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:54,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 10:31:54,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 10:31:54,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:54,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:31:55,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:55,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929604451] [2025-02-06 10:31:55,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929604451] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:31:55,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772013746] [2025-02-06 10:31:55,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:55,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:31:55,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:31:55,367 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:31:55,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:31:55,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 10:31:55,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 10:31:55,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:55,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:55,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 10:31:55,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:31:55,521 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-06 10:31:55,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-06 10:31:55,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:55,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:55,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:55,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:31:55,568 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 5 treesize of output 3 [2025-02-06 10:31:55,574 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (<= (+ 1 |chain_node_alloc_node_~ptr~0#1.base|) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#length| |chain_node_alloc_node_~ptr~0#1.base|)) |c_#length|))) is different from true [2025-02-06 10:31:55,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:55,610 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 14 treesize of output 9 [2025-02-06 10:31:55,629 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 5 treesize of output 3 [2025-02-06 10:31:55,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:55,669 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 14 treesize of output 9 [2025-02-06 10:31:55,697 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 5 treesize of output 3 [2025-02-06 10:31:55,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:55,736 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 14 treesize of output 9 [2025-02-06 10:31:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 10:31:55,746 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:31:55,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772013746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:31:55,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:31:55,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 18 [2025-02-06 10:31:55,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754256454] [2025-02-06 10:31:55,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:31:55,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:31:55,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:31:55,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:31:55,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=256, Unknown=1, NotChecked=32, Total=342 [2025-02-06 10:31:55,747 INFO L87 Difference]: Start difference. First operand 229 states and 254 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:31:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:31:55,950 INFO L93 Difference]: Finished difference Result 237 states and 265 transitions. [2025-02-06 10:31:55,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:31:55,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2025-02-06 10:31:55,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:31:55,951 INFO L225 Difference]: With dead ends: 237 [2025-02-06 10:31:55,951 INFO L226 Difference]: Without dead ends: 237 [2025-02-06 10:31:55,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=256, Unknown=1, NotChecked=32, Total=342 [2025-02-06 10:31:55,952 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 59 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 287 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:31:55,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 446 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 373 Invalid, 0 Unknown, 287 Unchecked, 0.2s Time] [2025-02-06 10:31:55,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-02-06 10:31:55,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 222. [2025-02-06 10:31:55,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 137 states have (on average 1.583941605839416) internal successors, (217), 207 states have internal predecessors, (217), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 10:31:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 245 transitions. [2025-02-06 10:31:55,957 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 245 transitions. Word has length 55 [2025-02-06 10:31:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:31:55,957 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 245 transitions. [2025-02-06 10:31:55,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:31:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 245 transitions. [2025-02-06 10:31:55,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 10:31:55,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:31:55,958 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:31:55,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 10:31:56,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:31:56,162 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-02-06 10:31:56,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:31:56,162 INFO L85 PathProgramCache]: Analyzing trace with hash 866263654, now seen corresponding path program 1 times [2025-02-06 10:31:56,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:31:56,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431519566] [2025-02-06 10:31:56,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:56,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:31:56,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 10:31:56,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 10:31:56,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:56,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:31:57,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:31:57,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431519566] [2025-02-06 10:31:57,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431519566] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:31:57,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579643844] [2025-02-06 10:31:57,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:31:57,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:31:57,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:31:57,092 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:31:57,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 10:31:57,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 10:31:57,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 10:31:57,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:31:57,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:31:57,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-06 10:31:57,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:31:57,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2025-02-06 10:31:57,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2025-02-06 10:31:57,290 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-02-06 10:31:57,295 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2025-02-06 10:31:57,303 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 9 treesize of output 5 [2025-02-06 10:31:57,309 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-02-06 10:31:57,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:57,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2025-02-06 10:31:57,328 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-02-06 10:31:57,336 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-02-06 10:31:57,344 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-02-06 10:31:57,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:57,352 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2025-02-06 10:31:57,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:31:57,426 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 11 treesize of output 15 [2025-02-06 10:31:57,430 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 5 treesize of output 3 [2025-02-06 10:31:57,442 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (<= (+ 1 |chain_node_alloc_node_~ptr~0#1.base|) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base|) 0) (= (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#length| |chain_node_alloc_node_~ptr~0#1.base|)) |c_#length|))) is different from true [2025-02-06 10:31:57,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:57,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:57,519 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:31:57,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2025-02-06 10:31:57,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:57,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2025-02-06 10:31:57,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:31:57,627 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 11 treesize of output 15 [2025-02-06 10:31:57,646 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (<= (+ 1 |chain_node_alloc_node_~ptr~0#1.base|) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#length| |chain_node_alloc_node_~ptr~0#1.base|)) |c_#length|))) is different from true [2025-02-06 10:31:57,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:57,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:57,688 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:31:57,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2025-02-06 10:31:57,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:31:57,729 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 11 treesize of output 15 [2025-02-06 10:31:57,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:57,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:31:57,850 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:31:57,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2025-02-06 10:31:57,888 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 33 not checked. [2025-02-06 10:31:57,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:32:01,987 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_sll_~#list~0#1.offset| 4))) (and (or (< 0 (+ |c_ULTIMATE.start_create_sll_~pp1#1.offset| 1)) (forall ((|v_chain_node_alloc_node_~ptr~0#1.base_35| Int) (v_ArrVal_821 Int)) (or (< |c_#StackHeapBarrier| (+ |v_chain_node_alloc_node_~ptr~0#1.base_35| 1)) (< (select (store |c_#length| |v_chain_node_alloc_node_~ptr~0#1.base_35| v_ArrVal_821) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) .cse0)))) (forall ((|v_chain_node_alloc_node_~ptr~0#1.base_35| Int)) (or (forall ((v_ArrVal_821 Int)) (let ((.cse1 (store |c_#length| |v_chain_node_alloc_node_~ptr~0#1.base_35| v_ArrVal_821))) (or (< (+ 3 |c_ULTIMATE.start_create_sll_~pp1#1.offset|) (select .cse1 |c_ULTIMATE.start_create_sll_~pp1#1.base|)) (< (select .cse1 |c_ULTIMATE.start_create_sll_~#list~0#1.base|) .cse0)))) (< |c_#StackHeapBarrier| (+ |v_chain_node_alloc_node_~ptr~0#1.base_35| 1)))))) is different from false [2025-02-06 10:32:01,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579643844] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:32:01,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:32:01,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 24 [2025-02-06 10:32:01,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3035407] [2025-02-06 10:32:01,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:32:01,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 10:32:01,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:32:01,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 10:32:01,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=471, Unknown=3, NotChecked=138, Total=702 [2025-02-06 10:32:01,990 INFO L87 Difference]: Start difference. First operand 222 states and 245 transitions. Second operand has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 23 states have internal predecessors, (92), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 10:32:03,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:32:03,610 INFO L93 Difference]: Finished difference Result 228 states and 251 transitions. [2025-02-06 10:32:03,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:32:03,611 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 23 states have internal predecessors, (92), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 55 [2025-02-06 10:32:03,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:32:03,612 INFO L225 Difference]: With dead ends: 228 [2025-02-06 10:32:03,613 INFO L226 Difference]: Without dead ends: 228 [2025-02-06 10:32:03,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=171, Invalid=830, Unknown=3, NotChecked=186, Total=1190 [2025-02-06 10:32:03,617 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 95 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 1861 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 450 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:32:03,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1212 Invalid, 2329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1861 Invalid, 0 Unknown, 450 Unchecked, 1.2s Time] [2025-02-06 10:32:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-06 10:32:03,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 215. [2025-02-06 10:32:03,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 132 states have (on average 1.5909090909090908) internal successors, (210), 201 states have internal predecessors, (210), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 10:32:03,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 236 transitions. [2025-02-06 10:32:03,625 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 236 transitions. Word has length 55 [2025-02-06 10:32:03,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:32:03,625 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 236 transitions. [2025-02-06 10:32:03,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 23 states have internal predecessors, (92), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 10:32:03,625 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 236 transitions. [2025-02-06 10:32:03,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 10:32:03,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:32:03,626 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:32:03,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 10:32:03,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 10:32:03,831 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-02-06 10:32:03,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:32:03,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1070650361, now seen corresponding path program 1 times [2025-02-06 10:32:03,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:32:03,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027359389] [2025-02-06 10:32:03,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:32:03,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:32:03,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 10:32:03,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 10:32:03,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:32:03,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:32:04,099 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:32:04,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:32:04,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027359389] [2025-02-06 10:32:04,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027359389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:32:04,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:32:04,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:32:04,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354291868] [2025-02-06 10:32:04,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:32:04,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:32:04,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:32:04,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:32:04,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:32:04,101 INFO L87 Difference]: Start difference. First operand 215 states and 236 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:32:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:32:04,412 INFO L93 Difference]: Finished difference Result 219 states and 241 transitions. [2025-02-06 10:32:04,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:32:04,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2025-02-06 10:32:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:32:04,414 INFO L225 Difference]: With dead ends: 219 [2025-02-06 10:32:04,414 INFO L226 Difference]: Without dead ends: 219 [2025-02-06 10:32:04,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:32:04,418 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 242 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:32:04,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 418 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:32:04,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-06 10:32:04,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2025-02-06 10:32:04,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 132 states have (on average 1.5378787878787878) internal successors, (203), 194 states have internal predecessors, (203), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 10:32:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 229 transitions. [2025-02-06 10:32:04,421 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 229 transitions. Word has length 62 [2025-02-06 10:32:04,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:32:04,423 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 229 transitions. [2025-02-06 10:32:04,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:32:04,423 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 229 transitions. [2025-02-06 10:32:04,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 10:32:04,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:32:04,424 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:32:04,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:32:04,424 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-02-06 10:32:04,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:32:04,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1070650362, now seen corresponding path program 1 times [2025-02-06 10:32:04,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:32:04,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559635997] [2025-02-06 10:32:04,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:32:04,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:32:04,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 10:32:04,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 10:32:04,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:32:04,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:32:04,652 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:32:04,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:32:04,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559635997] [2025-02-06 10:32:04,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559635997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:32:04,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:32:04,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:32:04,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030191858] [2025-02-06 10:32:04,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:32:04,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:32:04,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:32:04,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:32:04,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:32:04,654 INFO L87 Difference]: Start difference. First operand 208 states and 229 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:32:05,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:32:05,025 INFO L93 Difference]: Finished difference Result 225 states and 253 transitions. [2025-02-06 10:32:05,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:32:05,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2025-02-06 10:32:05,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:32:05,027 INFO L225 Difference]: With dead ends: 225 [2025-02-06 10:32:05,027 INFO L226 Difference]: Without dead ends: 225 [2025-02-06 10:32:05,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:32:05,027 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 212 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:32:05,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 300 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:32:05,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-02-06 10:32:05,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 212. [2025-02-06 10:32:05,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 141 states have (on average 1.4680851063829787) internal successors, (207), 197 states have internal predecessors, (207), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 10:32:05,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 235 transitions. [2025-02-06 10:32:05,031 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 235 transitions. Word has length 62 [2025-02-06 10:32:05,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:32:05,032 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 235 transitions. [2025-02-06 10:32:05,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:32:05,032 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 235 transitions. [2025-02-06 10:32:05,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 10:32:05,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:32:05,032 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:32:05,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:32:05,032 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-02-06 10:32:05,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:32:05,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1169576971, now seen corresponding path program 1 times [2025-02-06 10:32:05,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:32:05,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376579103] [2025-02-06 10:32:05,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:32:05,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:32:05,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 10:32:05,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 10:32:05,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:32:05,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:32:05,315 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:32:05,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:32:05,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376579103] [2025-02-06 10:32:05,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376579103] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:32:05,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766917282] [2025-02-06 10:32:05,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:32:05,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:32:05,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:32:05,317 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:32:05,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 10:32:05,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 10:32:05,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 10:32:05,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:32:05,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:32:05,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 10:32:05,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:32:05,496 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-06 10:32:05,497 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 21 treesize of output 13 [2025-02-06 10:32:05,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:32:05,521 INFO L349 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2025-02-06 10:32:05,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2025-02-06 10:32:05,530 INFO L349 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2025-02-06 10:32:05,532 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 1 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 10:32:05,551 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 5 treesize of output 3 [2025-02-06 10:32:05,557 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (<= (+ 1 |chain_node_alloc_node_~ptr~0#1.base|) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#valid| |chain_node_alloc_node_~ptr~0#1.base|))))) is different from true [2025-02-06 10:32:05,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:32:05,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:32:05,629 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 5 treesize of output 3 [2025-02-06 10:32:05,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:32:05,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:32:05,762 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1))) is different from true [2025-02-06 10:32:05,775 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:32:05,775 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 12 treesize of output 14 [2025-02-06 10:32:05,795 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 14 treesize of output 9 [2025-02-06 10:32:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 22 not checked. [2025-02-06 10:32:05,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:32:06,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766917282] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:32:06,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:32:06,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2025-02-06 10:32:06,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714811499] [2025-02-06 10:32:06,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:32:06,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 10:32:06,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:32:06,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 10:32:06,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=275, Unknown=2, NotChecked=70, Total=420 [2025-02-06 10:32:06,067 INFO L87 Difference]: Start difference. First operand 212 states and 235 transitions. Second operand has 16 states, 15 states have (on average 6.066666666666666) internal successors, (91), 15 states have internal predecessors, (91), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 10:32:06,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:32:06,672 INFO L93 Difference]: Finished difference Result 216 states and 240 transitions. [2025-02-06 10:32:06,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:32:06,676 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.066666666666666) internal successors, (91), 15 states have internal predecessors, (91), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 63 [2025-02-06 10:32:06,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:32:06,676 INFO L225 Difference]: With dead ends: 216 [2025-02-06 10:32:06,676 INFO L226 Difference]: Without dead ends: 216 [2025-02-06 10:32:06,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=476, Unknown=2, NotChecked=94, Total=702 [2025-02-06 10:32:06,677 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 314 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 441 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:32:06,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 603 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 960 Invalid, 0 Unknown, 441 Unchecked, 0.5s Time] [2025-02-06 10:32:06,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-06 10:32:06,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 205. [2025-02-06 10:32:06,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 141 states have (on average 1.4184397163120568) internal successors, (200), 190 states have internal predecessors, (200), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 10:32:06,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 228 transitions. [2025-02-06 10:32:06,686 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 228 transitions. Word has length 63 [2025-02-06 10:32:06,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:32:06,686 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 228 transitions. [2025-02-06 10:32:06,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.066666666666666) internal successors, (91), 15 states have internal predecessors, (91), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 10:32:06,686 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 228 transitions. [2025-02-06 10:32:06,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 10:32:06,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:32:06,687 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:32:06,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 10:32:06,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 10:32:06,888 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-02-06 10:32:06,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:32:06,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1169576970, now seen corresponding path program 1 times [2025-02-06 10:32:06,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:32:06,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113114287] [2025-02-06 10:32:06,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:32:06,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:32:06,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 10:32:06,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 10:32:06,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:32:06,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:32:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:32:07,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:32:07,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113114287] [2025-02-06 10:32:07,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113114287] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:32:07,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199004254] [2025-02-06 10:32:07,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:32:07,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:32:07,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:32:07,286 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:32:07,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 10:32:07,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 10:32:07,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 10:32:07,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:32:07,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:32:07,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 10:32:07,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:32:07,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:32:07,544 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-02-06 10:32:07,565 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 5 treesize of output 3 [2025-02-06 10:32:07,570 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (<= (+ 1 |chain_node_alloc_node_~ptr~0#1.base|) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#length| |chain_node_alloc_node_~ptr~0#1.base|)) |c_#length|))) is different from true [2025-02-06 10:32:07,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:32:07,605 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 14 treesize of output 9 [2025-02-06 10:32:07,636 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 5 treesize of output 3 [2025-02-06 10:32:07,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:32:07,697 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 14 treesize of output 9 [2025-02-06 10:32:07,726 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 5 treesize of output 3 [2025-02-06 10:32:07,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:32:07,765 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 14 treesize of output 9 [2025-02-06 10:32:07,783 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 10:32:07,783 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:32:07,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199004254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:32:07,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:32:07,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-02-06 10:32:07,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103712639] [2025-02-06 10:32:07,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:32:07,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:32:07,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:32:07,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:32:07,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2025-02-06 10:32:07,784 INFO L87 Difference]: Start difference. First operand 205 states and 228 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:32:07,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:32:07,950 INFO L93 Difference]: Finished difference Result 289 states and 323 transitions. [2025-02-06 10:32:07,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:32:07,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 63 [2025-02-06 10:32:07,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:32:07,951 INFO L225 Difference]: With dead ends: 289 [2025-02-06 10:32:07,951 INFO L226 Difference]: Without dead ends: 289 [2025-02-06 10:32:07,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2025-02-06 10:32:07,952 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 142 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 361 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:32:07,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 306 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 320 Invalid, 0 Unknown, 361 Unchecked, 0.2s Time] [2025-02-06 10:32:07,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-06 10:32:07,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 265. [2025-02-06 10:32:07,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 196 states have (on average 1.4285714285714286) internal successors, (280), 245 states have internal predecessors, (280), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 10:32:07,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 318 transitions. [2025-02-06 10:32:07,956 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 318 transitions. Word has length 63 [2025-02-06 10:32:07,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:32:07,957 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 318 transitions. [2025-02-06 10:32:07,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:32:07,957 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 318 transitions. [2025-02-06 10:32:07,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 10:32:07,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:32:07,957 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:32:07,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 10:32:08,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 10:32:08,158 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-02-06 10:32:08,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:32:08,158 INFO L85 PathProgramCache]: Analyzing trace with hash -703860437, now seen corresponding path program 1 times [2025-02-06 10:32:08,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:32:08,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033321603] [2025-02-06 10:32:08,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:32:08,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:32:08,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 10:32:08,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 10:32:08,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:32:08,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:32:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 10:32:08,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:32:08,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033321603] [2025-02-06 10:32:08,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033321603] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:32:08,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158939734] [2025-02-06 10:32:08,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:32:08,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:32:08,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:32:08,428 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:32:08,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 10:32:08,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 10:32:08,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 10:32:08,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:32:08,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:32:08,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-06 10:32:08,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:32:08,761 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 15 treesize of output 1 [2025-02-06 10:32:08,887 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 15 treesize of output 11 [2025-02-06 10:32:08,960 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:32:08,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:32:08,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 15 [2025-02-06 10:32:09,120 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 20 treesize of output 12 [2025-02-06 10:32:09,214 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:32:09,214 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:32:09,224 INFO L349 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2025-02-06 10:32:09,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 23 [2025-02-06 10:32:09,231 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:32:09,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:32:09,394 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 30 treesize of output 26 [2025-02-06 10:32:09,501 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 18 treesize of output 16 [2025-02-06 10:32:09,505 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 26 treesize of output 24 [2025-02-06 10:32:09,580 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 30 treesize of output 26 [2025-02-06 10:32:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:32:09,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158939734] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:32:09,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:32:09,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 17] total 38 [2025-02-06 10:32:09,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261686234] [2025-02-06 10:32:09,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:32:09,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-06 10:32:09,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:32:09,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-06 10:32:09,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1282, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 10:32:09,834 INFO L87 Difference]: Start difference. First operand 265 states and 318 transitions. Second operand has 38 states, 38 states have (on average 3.473684210526316) internal successors, (132), 36 states have internal predecessors, (132), 8 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2025-02-06 10:32:13,993 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-02-06 10:32:18,028 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-02-06 10:32:22,109 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-02-06 10:32:26,152 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-02-06 10:32:30,210 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-02-06 10:32:34,295 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-02-06 10:32:38,316 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-02-06 10:32:39,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:32:39,724 INFO L93 Difference]: Finished difference Result 350 states and 407 transitions. [2025-02-06 10:32:39,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 10:32:39,724 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.473684210526316) internal successors, (132), 36 states have internal predecessors, (132), 8 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) Word has length 71 [2025-02-06 10:32:39,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:32:39,725 INFO L225 Difference]: With dead ends: 350 [2025-02-06 10:32:39,725 INFO L226 Difference]: Without dead ends: 350 [2025-02-06 10:32:39,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=376, Invalid=3164, Unknown=0, NotChecked=0, Total=3540 [2025-02-06 10:32:39,726 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 340 mSDsluCounter, 3090 mSDsCounter, 0 mSdLazyCounter, 2704 mSolverCounterSat, 28 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 3227 SdHoareTripleChecker+Invalid, 2739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2704 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:32:39,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 3227 Invalid, 2739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2704 Invalid, 7 Unknown, 0 Unchecked, 29.3s Time] [2025-02-06 10:32:39,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-02-06 10:32:39,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 311. [2025-02-06 10:32:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 239 states have (on average 1.4142259414225942) internal successors, (338), 288 states have internal predecessors, (338), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 10:32:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 376 transitions. [2025-02-06 10:32:39,732 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 376 transitions. Word has length 71 [2025-02-06 10:32:39,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:32:39,732 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 376 transitions. [2025-02-06 10:32:39,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.473684210526316) internal successors, (132), 36 states have internal predecessors, (132), 8 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2025-02-06 10:32:39,732 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 376 transitions. [2025-02-06 10:32:39,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 10:32:39,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:32:39,733 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:32:39,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 10:32:39,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:32:39,933 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting check_seq_nextErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-02-06 10:32:39,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:32:39,934 INFO L85 PathProgramCache]: Analyzing trace with hash -534343587, now seen corresponding path program 1 times [2025-02-06 10:32:39,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:32:39,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927791967] [2025-02-06 10:32:39,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:32:39,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:32:39,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 10:32:39,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 10:32:39,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:32:39,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:32:40,561 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:32:40,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:32:40,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927791967] [2025-02-06 10:32:40,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927791967] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:32:40,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913918813] [2025-02-06 10:32:40,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:32:40,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:32:40,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:32:40,568 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:32:40,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 10:32:40,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 10:32:40,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 10:32:40,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:32:40,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:32:40,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-06 10:32:40,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:32:41,030 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 15 treesize of output 1 [2025-02-06 10:32:41,050 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_chain_node_~ppnode#1.offset_41| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_chain_node_#in~ppnode#1.base|) |v_chain_node_~ppnode#1.offset_41|))) (and (<= 0 |v_chain_node_~ppnode#1.offset_41|) (= (select |c_old(#valid)| .cse0) 0) (<= |v_chain_node_~ppnode#1.offset_41| |c_chain_node_#in~ppnode#1.offset|) (= |c_#valid| (store |c_old(#valid)| .cse0 1))))) is different from true [2025-02-06 10:32:41,104 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-02-06 10:32:41,105 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 29 [2025-02-06 10:32:41,214 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:32:41,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 10:32:41,266 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 15 treesize of output 1 [2025-02-06 10:32:41,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 15 treesize of output 7 [2025-02-06 10:32:41,411 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1))) is different from true [2025-02-06 10:32:41,433 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2025-02-06 10:32:41,433 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 21 treesize of output 26 [2025-02-06 10:32:41,512 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 0 case distinctions, treesize of input 23 treesize of output 16 [2025-02-06 10:32:41,573 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:32:41,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:32:41,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 12 [2025-02-06 10:32:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 10 not checked. [2025-02-06 10:32:41,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:32:41,871 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 32 treesize of output 28 [2025-02-06 10:32:41,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 30 treesize of output 26 [2025-02-06 10:32:42,018 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 33 treesize of output 29 [2025-02-06 10:32:42,022 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 45 treesize of output 41 [2025-02-06 10:32:42,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913918813] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:32:42,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:32:42,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 34 [2025-02-06 10:32:42,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882474813] [2025-02-06 10:32:42,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:32:42,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 10:32:42,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:32:42,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 10:32:42,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1411, Unknown=2, NotChecked=154, Total=1722 [2025-02-06 10:32:42,087 INFO L87 Difference]: Start difference. First operand 311 states and 376 transitions. Second operand has 35 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 33 states have internal predecessors, (120), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:32:43,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:32:43,200 INFO L93 Difference]: Finished difference Result 318 states and 380 transitions. [2025-02-06 10:32:43,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 10:32:43,202 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 33 states have internal predecessors, (120), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 72 [2025-02-06 10:32:43,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:32:43,203 INFO L225 Difference]: With dead ends: 318 [2025-02-06 10:32:43,203 INFO L226 Difference]: Without dead ends: 318 [2025-02-06 10:32:43,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=291, Invalid=2367, Unknown=2, NotChecked=202, Total=2862 [2025-02-06 10:32:43,204 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 225 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 2174 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 2680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 480 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:32:43,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1542 Invalid, 2680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2174 Invalid, 0 Unknown, 480 Unchecked, 0.9s Time] [2025-02-06 10:32:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-02-06 10:32:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 311. [2025-02-06 10:32:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 239 states have (on average 1.4100418410041842) internal successors, (337), 288 states have internal predecessors, (337), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 10:32:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 375 transitions. [2025-02-06 10:32:43,212 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 375 transitions. Word has length 72 [2025-02-06 10:32:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:32:43,212 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 375 transitions. [2025-02-06 10:32:43,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 33 states have internal predecessors, (120), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:32:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 375 transitions. [2025-02-06 10:32:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 10:32:43,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:32:43,213 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:32:43,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 10:32:43,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:32:43,413 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting check_seq_nextErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-02-06 10:32:43,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:32:43,414 INFO L85 PathProgramCache]: Analyzing trace with hash -534343586, now seen corresponding path program 1 times [2025-02-06 10:32:43,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:32:43,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836114060] [2025-02-06 10:32:43,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:32:43,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:32:43,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 10:32:43,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 10:32:43,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:32:43,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:32:43,977 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:32:43,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:32:43,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836114060] [2025-02-06 10:32:43,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836114060] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:32:43,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719971471] [2025-02-06 10:32:43,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:32:43,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:32:43,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:32:43,981 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:32:43,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 10:32:44,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 10:32:44,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 10:32:44,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:32:44,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:32:44,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-02-06 10:32:44,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:32:44,319 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-02-06 10:32:44,322 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 15 treesize of output 1 [2025-02-06 10:32:44,454 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:32:44,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:32:44,514 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 15 treesize of output 11 [2025-02-06 10:32:44,516 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-02-06 10:32:44,593 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:32:44,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:32:44,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 21 [2025-02-06 10:32:44,607 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 9 treesize of output 3 [2025-02-06 10:32:44,609 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 9 treesize of output 3 [2025-02-06 10:32:44,789 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|chain_node_~ppnode#1.offset| Int)) (and (= |c_chain_node_#t~mem5#1.base| (select (select |c_old(#memory_$Pointer$#3.base)| |c_chain_node_#in~ppnode#1.base|) |chain_node_~ppnode#1.offset|)) (<= |chain_node_~ppnode#1.offset| |c_chain_node_#in~ppnode#1.offset|) (<= 0 |chain_node_~ppnode#1.offset|))) (exists ((|v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_13| Int)) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_13|) 0) 0)) (exists ((|chain_node_~node~0#1.base| Int)) (and (= |c_#length| (store |c_old(#length)| |chain_node_~node~0#1.base| (select |c_#length| |chain_node_~node~0#1.base|))) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0)))) is different from true [2025-02-06 10:32:44,842 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 30 treesize of output 18 [2025-02-06 10:32:44,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:32:44,847 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 18 treesize of output 13 [2025-02-06 10:32:44,853 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 10:32:44,853 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 15 treesize of output 15 [2025-02-06 10:32:44,973 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:32:44,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 10:32:44,976 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:32:44,977 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:32:44,984 INFO L349 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2025-02-06 10:32:44,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 13 [2025-02-06 10:32:45,086 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-02-06 10:32:45,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:32:45,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719971471] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:32:45,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:32:45,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 35 [2025-02-06 10:32:45,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619830273] [2025-02-06 10:32:45,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:32:45,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 10:32:45,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:32:45,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 10:32:45,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1454, Unknown=1, NotChecked=76, Total=1640 [2025-02-06 10:32:45,309 INFO L87 Difference]: Start difference. First operand 311 states and 375 transitions. Second operand has 36 states, 35 states have (on average 3.3714285714285714) internal successors, (118), 32 states have internal predecessors, (118), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 10:32:48,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:32:48,175 INFO L93 Difference]: Finished difference Result 338 states and 395 transitions. [2025-02-06 10:32:48,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-06 10:32:48,176 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.3714285714285714) internal successors, (118), 32 states have internal predecessors, (118), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 72 [2025-02-06 10:32:48,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:32:48,177 INFO L225 Difference]: With dead ends: 338 [2025-02-06 10:32:48,177 INFO L226 Difference]: Without dead ends: 338 [2025-02-06 10:32:48,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=315, Invalid=3848, Unknown=1, NotChecked=126, Total=4290 [2025-02-06 10:32:48,178 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 444 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 3644 mSolverCounterSat, 56 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 3996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 3644 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 295 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:32:48,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1965 Invalid, 3996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 3644 Invalid, 1 Unknown, 295 Unchecked, 1.8s Time] [2025-02-06 10:32:48,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-02-06 10:32:48,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 311. [2025-02-06 10:32:48,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 239 states have (on average 1.405857740585774) internal successors, (336), 288 states have internal predecessors, (336), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 10:32:48,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 374 transitions. [2025-02-06 10:32:48,183 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 374 transitions. Word has length 72 [2025-02-06 10:32:48,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:32:48,184 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 374 transitions. [2025-02-06 10:32:48,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.3714285714285714) internal successors, (118), 32 states have internal predecessors, (118), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 10:32:48,184 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 374 transitions. [2025-02-06 10:32:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 10:32:48,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:32:48,184 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:32:48,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 10:32:48,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:32:48,385 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2025-02-06 10:32:48,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:32:48,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1898158839, now seen corresponding path program 1 times [2025-02-06 10:32:48,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:32:48,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994263579] [2025-02-06 10:32:48,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:32:48,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:32:48,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 10:32:48,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 10:32:48,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:32:48,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:32:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 10:32:48,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:32:48,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994263579] [2025-02-06 10:32:48,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994263579] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:32:48,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733139116] [2025-02-06 10:32:48,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:32:48,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:32:48,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:32:48,642 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:32:48,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 10:32:48,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 10:32:48,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 10:32:48,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:32:48,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:32:48,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 10:32:48,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:32:48,863 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 15 treesize of output 1 [2025-02-06 10:32:48,896 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 16 treesize of output 8 [2025-02-06 10:32:48,917 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 15 treesize of output 1 [2025-02-06 10:32:49,166 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:32:49,167 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:32:49,175 INFO L349 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2025-02-06 10:32:49,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 23 [2025-02-06 10:32:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:32:49,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:32:49,293 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 30 treesize of output 26 [2025-02-06 10:32:49,401 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 30 treesize of output 26 [2025-02-06 10:32:49,526 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:32:49,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733139116] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:32:49,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:32:49,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 16] total 31 [2025-02-06 10:32:49,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140615030] [2025-02-06 10:32:49,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:32:49,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 10:32:49,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:32:49,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 10:32:49,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=834, Unknown=0, NotChecked=0, Total=930 [2025-02-06 10:32:49,532 INFO L87 Difference]: Start difference. First operand 311 states and 374 transitions. Second operand has 31 states, 30 states have (on average 4.533333333333333) internal successors, (136), 30 states have internal predecessors, (136), 8 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2025-02-06 10:32:53,606 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-02-06 10:32:57,609 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-02-06 10:33:01,615 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-02-06 10:33:05,619 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-02-06 10:33:09,664 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, 1] [2025-02-06 10:33:13,668 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, 1] [2025-02-06 10:33:17,680 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, 1]