./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:48:00,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:48:00,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:48:00,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:48:00,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:48:00,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:48:00,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:48:00,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:48:00,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:48:00,639 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:48:00,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:48:00,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:48:00,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:48:00,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:48:00,640 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:48:00,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:48:00,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:48:00,640 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:48:00,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:48:00,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:48:00,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:48:00,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:48:00,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:48:00,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:48:00,641 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:48:00,641 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:48:00,641 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:48:00,641 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:48:00,641 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:48:00,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:48:00,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:48:00,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:48:00,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:48:00,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:48:00,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:48:00,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:48:00,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:48:00,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:48:00,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:48:00,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:48:00,642 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:48:00,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:48:00,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:48:00,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:48:00,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:48:00,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:48:00,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:48:00,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:48:00,643 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 ! call(reach_error())) ) 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 -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2025-01-09 02:48:00,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:48:00,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:48:00,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:48:00,904 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:48:00,905 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:48:00,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2025-01-09 02:48:02,078 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b6c5d131/92679e7f977c43dbb0189c4abc7de9d4/FLAG517db66d2 [2025-01-09 02:48:02,372 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:48:02,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2025-01-09 02:48:02,388 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b6c5d131/92679e7f977c43dbb0189c4abc7de9d4/FLAG517db66d2 [2025-01-09 02:48:02,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b6c5d131/92679e7f977c43dbb0189c4abc7de9d4 [2025-01-09 02:48:02,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:48:02,408 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:48:02,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:48:02,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:48:02,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:48:02,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:48:02" (1/1) ... [2025-01-09 02:48:02,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2913649e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:02, skipping insertion in model container [2025-01-09 02:48:02,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:48:02" (1/1) ... [2025-01-09 02:48:02,441 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:48:02,640 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2025-01-09 02:48:02,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:48:02,649 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:48:02,682 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2025-01-09 02:48:02,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:48:02,706 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:48:02,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:02 WrapperNode [2025-01-09 02:48:02,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:48:02,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:48:02,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:48:02,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:48:02,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:02" (1/1) ... [2025-01-09 02:48:02,730 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:02" (1/1) ... [2025-01-09 02:48:02,746 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2025-01-09 02:48:02,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:48:02,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:48:02,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:48:02,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:48:02,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:02" (1/1) ... [2025-01-09 02:48:02,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:02" (1/1) ... [2025-01-09 02:48:02,761 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:02" (1/1) ... [2025-01-09 02:48:02,772 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 13, 6]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 8, 1]. [2025-01-09 02:48:02,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:02" (1/1) ... [2025-01-09 02:48:02,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:02" (1/1) ... [2025-01-09 02:48:02,778 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:02" (1/1) ... [2025-01-09 02:48:02,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:02" (1/1) ... [2025-01-09 02:48:02,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:02" (1/1) ... [2025-01-09 02:48:02,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:02" (1/1) ... [2025-01-09 02:48:02,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:02" (1/1) ... [2025-01-09 02:48:02,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:48:02,789 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:48:02,789 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:48:02,789 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:48:02,790 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:02" (1/1) ... [2025-01-09 02:48:02,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:48:02,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:02,813 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-01-09 02:48:02,815 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-01-09 02:48:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:48:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:48:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 02:48:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:48:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:48:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 02:48:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-01-09 02:48:02,831 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-01-09 02:48:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:48:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:48:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 02:48:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:48:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:48:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 02:48:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:48:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:48:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 02:48:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:48:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 02:48:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 02:48:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 02:48:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:48:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:48:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 02:48:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:48:02,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:48:02,917 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:48:02,919 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:48:03,072 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-01-09 02:48:03,072 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:48:03,082 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:48:03,082 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 02:48:03,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:48:03 BoogieIcfgContainer [2025-01-09 02:48:03,082 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:48:03,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:48:03,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:48:03,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:48:03,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:48:02" (1/3) ... [2025-01-09 02:48:03,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46710bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:48:03, skipping insertion in model container [2025-01-09 02:48:03,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:02" (2/3) ... [2025-01-09 02:48:03,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46710bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:48:03, skipping insertion in model container [2025-01-09 02:48:03,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:48:03" (3/3) ... [2025-01-09 02:48:03,089 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2025-01-09 02:48:03,099 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:48:03,101 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_append_equal.i that has 2 procedures, 32 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 02:48:03,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:48:03,151 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5df4c041, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:48:03,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:48:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:48:03,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 02:48:03,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:03,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:48:03,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:03,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:03,166 INFO L85 PathProgramCache]: Analyzing trace with hash 915446361, now seen corresponding path program 1 times [2025-01-09 02:48:03,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:03,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332857584] [2025-01-09 02:48:03,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:03,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:03,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 02:48:03,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 02:48:03,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:03,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:03,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:03,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332857584] [2025-01-09 02:48:03,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332857584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:48:03,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:48:03,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:48:03,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648032624] [2025-01-09 02:48:03,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:48:03,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:48:03,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:03,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:48:03,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:48:03,422 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-01-09 02:48:03,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:03,442 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2025-01-09 02:48:03,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:48:03,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2025-01-09 02:48:03,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:03,448 INFO L225 Difference]: With dead ends: 62 [2025-01-09 02:48:03,449 INFO L226 Difference]: Without dead ends: 31 [2025-01-09 02:48:03,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-09 02:48:03,452 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:03,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 73 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:48:03,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-09 02:48:03,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-01-09 02:48:03,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:48:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2025-01-09 02:48:03,479 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 16 [2025-01-09 02:48:03,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:03,479 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-01-09 02:48:03,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-01-09 02:48:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2025-01-09 02:48:03,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 02:48:03,480 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:03,480 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:48:03,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:48:03,480 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:03,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:03,481 INFO L85 PathProgramCache]: Analyzing trace with hash 878476677, now seen corresponding path program 1 times [2025-01-09 02:48:03,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:03,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510636287] [2025-01-09 02:48:03,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:03,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:03,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:48:03,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:48:03,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:03,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 02:48:03,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:03,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510636287] [2025-01-09 02:48:03,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510636287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:48:03,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:48:03,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:48:03,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376125937] [2025-01-09 02:48:03,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:48:03,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:48:03,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:03,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:48:03,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:48:03,617 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:48:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:03,636 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2025-01-09 02:48:03,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:48:03,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-01-09 02:48:03,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:03,637 INFO L225 Difference]: With dead ends: 54 [2025-01-09 02:48:03,637 INFO L226 Difference]: Without dead ends: 30 [2025-01-09 02:48:03,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-09 02:48:03,639 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:03,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:48:03,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-09 02:48:03,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-01-09 02:48:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:48:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2025-01-09 02:48:03,644 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 26 [2025-01-09 02:48:03,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:03,644 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-01-09 02:48:03,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:48:03,644 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2025-01-09 02:48:03,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 02:48:03,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:03,645 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:48:03,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:48:03,645 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:03,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:03,645 INFO L85 PathProgramCache]: Analyzing trace with hash -142591677, now seen corresponding path program 1 times [2025-01-09 02:48:03,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:03,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7802703] [2025-01-09 02:48:03,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:03,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:03,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:48:03,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:48:03,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:03,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 02:48:03,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:03,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7802703] [2025-01-09 02:48:03,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7802703] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:03,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418880027] [2025-01-09 02:48:03,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:03,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:03,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:03,817 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-01-09 02:48:03,819 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-01-09 02:48:03,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:48:03,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:48:03,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:03,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:03,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 02:48:03,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:48:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:03,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:48:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 02:48:04,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418880027] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:48:04,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:48:04,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-01-09 02:48:04,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163612387] [2025-01-09 02:48:04,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:48:04,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:48:04,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:04,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:48:04,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:48:04,028 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 02:48:04,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:04,047 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2025-01-09 02:48:04,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:48:04,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2025-01-09 02:48:04,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:04,048 INFO L225 Difference]: With dead ends: 51 [2025-01-09 02:48:04,048 INFO L226 Difference]: Without dead ends: 32 [2025-01-09 02:48:04,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:48:04,050 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:04,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 56 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:48:04,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-09 02:48:04,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-01-09 02:48:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:48:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-01-09 02:48:04,057 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2025-01-09 02:48:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:04,057 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-01-09 02:48:04,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 02:48:04,058 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-01-09 02:48:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 02:48:04,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:04,058 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:48:04,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 02:48:04,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:04,263 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:04,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:04,263 INFO L85 PathProgramCache]: Analyzing trace with hash 367656943, now seen corresponding path program 1 times [2025-01-09 02:48:04,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:04,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441090443] [2025-01-09 02:48:04,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:04,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:04,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 02:48:04,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:48:04,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:04,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 02:48:04,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:04,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441090443] [2025-01-09 02:48:04,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441090443] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:04,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694379294] [2025-01-09 02:48:04,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:04,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:04,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:04,577 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-01-09 02:48:04,578 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-01-09 02:48:04,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 02:48:04,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:48:04,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:04,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:04,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 02:48:04,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:48:04,808 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-01-09 02:48:04,827 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-01-09 02:48:04,839 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 02:48:04,839 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:48:04,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694379294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:48:04,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 02:48:04,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 15 [2025-01-09 02:48:04,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759013030] [2025-01-09 02:48:04,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:48:04,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 02:48:04,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:04,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 02:48:04,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-01-09 02:48:04,841 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:48:04,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:04,890 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2025-01-09 02:48:04,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 02:48:04,891 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2025-01-09 02:48:04,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:04,892 INFO L225 Difference]: With dead ends: 45 [2025-01-09 02:48:04,892 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 02:48:04,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-01-09 02:48:04,893 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:04,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 136 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:48:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 02:48:04,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2025-01-09 02:48:04,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:48:04,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2025-01-09 02:48:04,897 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 36 [2025-01-09 02:48:04,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:04,898 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2025-01-09 02:48:04,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:48:04,898 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2025-01-09 02:48:04,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 02:48:04,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:04,898 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:48:04,906 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-01-09 02:48:05,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:05,100 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:05,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:05,101 INFO L85 PathProgramCache]: Analyzing trace with hash 367649999, now seen corresponding path program 1 times [2025-01-09 02:48:05,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:05,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143104084] [2025-01-09 02:48:05,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:05,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:05,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 02:48:05,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:48:05,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:05,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 02:48:05,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:05,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143104084] [2025-01-09 02:48:05,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143104084] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:05,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318780896] [2025-01-09 02:48:05,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:05,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:05,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:05,402 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-01-09 02:48:05,403 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-01-09 02:48:05,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 02:48:05,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:48:05,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:05,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:05,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 02:48:05,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:48:05,619 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-01-09 02:48:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 02:48:05,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:48:05,698 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 02:48:05,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318780896] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:48:05,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:48:05,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 13 [2025-01-09 02:48:05,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115672307] [2025-01-09 02:48:05,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:48:05,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 02:48:05,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:05,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 02:48:05,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 02:48:05,704 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 02:48:09,723 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-01-09 02:48:13,740 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-01-09 02:48:17,769 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-01-09 02:48:21,799 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-01-09 02:48:21,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:21,881 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2025-01-09 02:48:21,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 02:48:21,882 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2025-01-09 02:48:21,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:21,882 INFO L225 Difference]: With dead ends: 63 [2025-01-09 02:48:21,882 INFO L226 Difference]: Without dead ends: 37 [2025-01-09 02:48:21,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-01-09 02:48:21,883 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:21,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 247 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2025-01-09 02:48:21,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-09 02:48:21,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-01-09 02:48:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:48:21,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2025-01-09 02:48:21,887 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 36 [2025-01-09 02:48:21,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:21,887 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2025-01-09 02:48:21,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 02:48:21,887 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2025-01-09 02:48:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 02:48:21,888 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:21,888 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:48:21,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 02:48:22,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:22,089 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:22,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:22,089 INFO L85 PathProgramCache]: Analyzing trace with hash 679940481, now seen corresponding path program 1 times [2025-01-09 02:48:22,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:22,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680144215] [2025-01-09 02:48:22,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:22,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:22,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 02:48:22,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 02:48:22,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:22,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 02:48:22,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:22,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680144215] [2025-01-09 02:48:22,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680144215] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:22,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808085399] [2025-01-09 02:48:22,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:22,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:22,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:22,222 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-01-09 02:48:22,224 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-01-09 02:48:22,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 02:48:22,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 02:48:22,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:22,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:22,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 02:48:22,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:48:22,438 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-01-09 02:48:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 02:48:22,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:48:22,478 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 02:48:22,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808085399] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:48:22,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:48:22,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 11 [2025-01-09 02:48:22,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821026063] [2025-01-09 02:48:22,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:48:22,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 02:48:22,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:22,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 02:48:22,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 02:48:22,479 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 02:48:26,496 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-01-09 02:48:30,505 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-01-09 02:48:34,537 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-01-09 02:48:38,555 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-01-09 02:48:38,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:38,627 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2025-01-09 02:48:38,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 02:48:38,627 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2025-01-09 02:48:38,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:38,628 INFO L225 Difference]: With dead ends: 44 [2025-01-09 02:48:38,628 INFO L226 Difference]: Without dead ends: 41 [2025-01-09 02:48:38,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-01-09 02:48:38,628 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:38,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 191 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2025-01-09 02:48:38,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-09 02:48:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2025-01-09 02:48:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:48:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-01-09 02:48:38,632 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 39 [2025-01-09 02:48:38,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:38,633 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-01-09 02:48:38,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 02:48:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-01-09 02:48:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 02:48:38,638 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:38,638 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:48:38,646 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-01-09 02:48:38,838 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,SelfDestructingSolverStorable5 [2025-01-09 02:48:38,839 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:38,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:38,839 INFO L85 PathProgramCache]: Analyzing trace with hash 679933537, now seen corresponding path program 1 times [2025-01-09 02:48:38,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:38,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958048392] [2025-01-09 02:48:38,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:38,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:38,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 02:48:38,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 02:48:38,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:38,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:40,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:40,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958048392] [2025-01-09 02:48:40,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958048392] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:40,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882540542] [2025-01-09 02:48:40,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:40,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:40,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:40,103 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-01-09 02:48:40,104 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-01-09 02:48:40,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 02:48:40,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 02:48:40,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:40,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:40,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-01-09 02:48:40,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:48:40,625 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-01-09 02:48:40,851 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:48:40,851 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 17 treesize of output 21 [2025-01-09 02:48:40,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 7 [2025-01-09 02:48:40,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2025-01-09 02:48:41,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2025-01-09 02:48:41,242 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-01-09 02:48:41,409 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-01-09 02:48:41,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-01-09 02:48:41,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-09 02:48:41,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-01-09 02:48:41,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-09 02:48:41,739 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 19 treesize of output 11 [2025-01-09 02:48:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:41,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:48:43,798 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_890 Int) (v_ArrVal_891 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4) v_ArrVal_890))) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_891) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2025-01-09 02:48:43,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882540542] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:43,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:48:43,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2025-01-09 02:48:43,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913222141] [2025-01-09 02:48:43,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:48:43,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-01-09 02:48:43,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:43,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-01-09 02:48:43,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2262, Unknown=28, NotChecked=96, Total=2550 [2025-01-09 02:48:43,890 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 47 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 38 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:48:44,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:44,933 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2025-01-09 02:48:44,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 02:48:44,933 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 38 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2025-01-09 02:48:44,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:44,934 INFO L225 Difference]: With dead ends: 55 [2025-01-09 02:48:44,934 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 02:48:44,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=291, Invalid=3717, Unknown=28, NotChecked=124, Total=4160 [2025-01-09 02:48:44,936 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:44,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 385 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 02:48:44,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 02:48:44,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2025-01-09 02:48:44,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:48:44,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-01-09 02:48:44,941 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 39 [2025-01-09 02:48:44,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:44,941 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-01-09 02:48:44,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 38 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:48:44,941 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-01-09 02:48:44,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 02:48:44,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:44,942 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:48:44,950 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-01-09 02:48:45,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:45,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:45,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:45,143 INFO L85 PathProgramCache]: Analyzing trace with hash 581147068, now seen corresponding path program 1 times [2025-01-09 02:48:45,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:45,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046524666] [2025-01-09 02:48:45,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:45,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:45,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 02:48:45,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 02:48:45,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:45,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:48:46,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:46,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046524666] [2025-01-09 02:48:46,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046524666] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:46,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116761758] [2025-01-09 02:48:46,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:46,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:46,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:46,032 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-01-09 02:48:46,033 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-01-09 02:48:46,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 02:48:46,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 02:48:46,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:46,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:46,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-01-09 02:48:46,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:48:46,171 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 5 [2025-01-09 02:48:46,249 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:48:46,249 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 17 treesize of output 21 [2025-01-09 02:48:46,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2025-01-09 02:48:46,325 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 02:48:46,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2025-01-09 02:48:46,483 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 60 treesize of output 18 [2025-01-09 02:48:46,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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-01-09 02:48:46,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:46,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 68 treesize of output 51 [2025-01-09 02:48:46,547 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-01-09 02:48:46,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2025-01-09 02:48:46,736 INFO L349 Elim1Store]: treesize reduction 53, result has 39.8 percent of original size [2025-01-09 02:48:46,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 71 [2025-01-09 02:48:46,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 67 treesize of output 50 [2025-01-09 02:48:46,775 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 48 treesize of output 32 [2025-01-09 02:48:46,777 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 36 treesize of output 24 [2025-01-09 02:48:46,809 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 12 [2025-01-09 02:48:46,839 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:46,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:48:47,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116761758] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:47,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:48:47,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 38 [2025-01-09 02:48:47,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352161627] [2025-01-09 02:48:47,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:48:47,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 02:48:47,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:47,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 02:48:47,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1852, Unknown=2, NotChecked=0, Total=1980 [2025-01-09 02:48:47,298 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 38 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 32 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 02:48:48,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:48,305 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2025-01-09 02:48:48,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 02:48:48,306 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 32 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2025-01-09 02:48:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:48,306 INFO L225 Difference]: With dead ends: 60 [2025-01-09 02:48:48,306 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 02:48:48,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=294, Invalid=3736, Unknown=2, NotChecked=0, Total=4032 [2025-01-09 02:48:48,307 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 54 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:48,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 355 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 02:48:48,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 02:48:48,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2025-01-09 02:48:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:48:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-01-09 02:48:48,312 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 41 [2025-01-09 02:48:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:48,313 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-01-09 02:48:48,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 32 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 02:48:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-01-09 02:48:48,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 02:48:48,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:48,313 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:48:48,319 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-01-09 02:48:48,516 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,SelfDestructingSolverStorable7 [2025-01-09 02:48:48,516 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:48,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:48,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1527334829, now seen corresponding path program 1 times [2025-01-09 02:48:48,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:48,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650441398] [2025-01-09 02:48:48,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:48,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:48,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 02:48:48,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 02:48:48,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:48,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:49,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:49,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650441398] [2025-01-09 02:48:49,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650441398] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:49,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249493946] [2025-01-09 02:48:49,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:49,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:49,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:49,565 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-01-09 02:48:49,566 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-01-09 02:48:49,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 02:48:49,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 02:48:49,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:49,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:49,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 130 conjuncts are in the unsatisfiable core [2025-01-09 02:48:49,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:48:49,990 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-01-09 02:48:50,232 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:48:50,232 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 17 treesize of output 21 [2025-01-09 02:48:50,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 7 [2025-01-09 02:48:50,299 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 11 treesize of output 7 [2025-01-09 02:48:50,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2025-01-09 02:48:50,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2025-01-09 02:48:50,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2025-01-09 02:48:50,654 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-01-09 02:48:50,656 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 11 treesize of output 3 [2025-01-09 02:48:50,834 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 02:48:50,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-01-09 02:48:50,856 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 02:48:50,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-01-09 02:48:50,875 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-01-09 02:48:50,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-01-09 02:48:51,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2025-01-09 02:48:51,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2025-01-09 02:48:51,224 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2025-01-09 02:48:51,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 39 treesize of output 1 [2025-01-09 02:48:51,276 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 19 treesize of output 11 [2025-01-09 02:48:51,339 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:51,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:48:51,349 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1288 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1288) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1289) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (store (select |c_#memory_int#1| |ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 (select v_ArrVal_1288 .cse0))) v_ArrVal_1288)))) is different from false [2025-01-09 02:48:51,365 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_~last~0#1.base_25| Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1288 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_~last~0#1.base_25| v_ArrVal_1288) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1289) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (let ((.cse0 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 4))) (store (select |c_#memory_int#1| |v_ULTIMATE.start_dll_append_~last~0#1.base_25|) .cse0 (select v_ArrVal_1288 .cse0))) v_ArrVal_1288)))) is different from false [2025-01-09 02:48:51,387 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_~last~0#1.base_25| Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1288 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_~last~0#1.base_25| v_ArrVal_1288) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1289) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_1288 (let ((.cse0 (+ (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)) 4))) (store (select |c_#memory_int#1| |v_ULTIMATE.start_dll_append_~last~0#1.base_25|) .cse0 (select v_ArrVal_1288 .cse0))))))) is different from false [2025-01-09 02:48:51,396 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_~last~0#1.base_25| Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1288 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_~last~0#1.base_25| v_ArrVal_1288) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1289) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_1288 (let ((.cse0 (+ (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)) 4))) (store (select |c_#memory_int#1| |v_ULTIMATE.start_dll_append_~last~0#1.base_25|) .cse0 (select v_ArrVal_1288 .cse0))))))) is different from false [2025-01-09 02:48:51,451 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_~last~0#1.base_25| Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1288 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_~last~0#1.base_25| v_ArrVal_1288) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1289) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (let ((.cse0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1297) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)) 4))) (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1296) |v_ULTIMATE.start_dll_append_~last~0#1.base_25|) .cse0 (select v_ArrVal_1288 .cse0))) v_ArrVal_1288)))) is different from false [2025-01-09 02:48:51,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249493946] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:51,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:48:51,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 51 [2025-01-09 02:48:51,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965032409] [2025-01-09 02:48:51,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:48:51,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-01-09 02:48:51,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:51,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-01-09 02:48:51,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2399, Unknown=5, NotChecked=510, Total=3080 [2025-01-09 02:48:51,454 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 51 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 42 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:48:52,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:52,823 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2025-01-09 02:48:52,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 02:48:52,824 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 42 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2025-01-09 02:48:52,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:52,827 INFO L225 Difference]: With dead ends: 61 [2025-01-09 02:48:52,827 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 02:48:52,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=316, Invalid=4391, Unknown=5, NotChecked=690, Total=5402 [2025-01-09 02:48:52,828 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 37 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:52,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 469 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 02:48:52,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 02:48:52,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2025-01-09 02:48:52,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:48:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2025-01-09 02:48:52,837 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 42 [2025-01-09 02:48:52,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:52,838 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2025-01-09 02:48:52,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 42 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:48:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2025-01-09 02:48:52,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 02:48:52,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:52,841 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:48:52,849 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-01-09 02:48:53,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:53,042 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:53,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:53,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1110084622, now seen corresponding path program 1 times [2025-01-09 02:48:53,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:53,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798562503] [2025-01-09 02:48:53,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:53,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:53,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 02:48:53,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 02:48:53,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:53,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:54,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:54,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798562503] [2025-01-09 02:48:54,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798562503] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:54,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445630939] [2025-01-09 02:48:54,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:54,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:54,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:54,803 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-01-09 02:48:54,804 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-01-09 02:48:54,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 02:48:55,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 02:48:55,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:55,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:55,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 155 conjuncts are in the unsatisfiable core [2025-01-09 02:48:55,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:48:55,185 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-01-09 02:48:55,192 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-01-09 02:48:55,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 11 [2025-01-09 02:48:55,383 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse0 (select |c_#memory_int#1| .cse0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse0)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2025-01-09 02:48:55,385 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse0 (select |c_#memory_int#1| .cse0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse0)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2025-01-09 02:48:55,408 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-01-09 02:48:55,413 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-01-09 02:48:55,427 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 02:48:55,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 02:48:55,446 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) is different from false [2025-01-09 02:48:55,449 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) is different from true [2025-01-09 02:48:55,477 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 02:48:55,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 75 [2025-01-09 02:48:55,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 47 treesize of output 23 [2025-01-09 02:48:55,497 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-01-09 02:48:55,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2025-01-09 02:48:55,506 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1))) (and (or .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) .cse0)))) is different from false [2025-01-09 02:48:55,507 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1))) (and (or .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) .cse0)))) is different from true [2025-01-09 02:48:55,537 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= (select (select |c_#memory_int#1| .cse1) 0) 1)) (or .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2025-01-09 02:48:55,539 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= (select (select |c_#memory_int#1| .cse1) 0) 1)) (or .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2025-01-09 02:48:55,562 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) .cse2)))) is different from false [2025-01-09 02:48:55,564 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) .cse2)))) is different from true [2025-01-09 02:48:55,609 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse1 (= .cse0 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) .cse1) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2025-01-09 02:48:55,611 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse1 (= .cse0 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) .cse1) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2025-01-09 02:48:55,621 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 72 treesize of output 40 [2025-01-09 02:48:55,625 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 19 treesize of output 11 [2025-01-09 02:48:55,630 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 15 treesize of output 11 [2025-01-09 02:48:55,652 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= 1 (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_57)) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1))))) is different from false [2025-01-09 02:48:55,654 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= 1 (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_57)) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1))))) is different from true [2025-01-09 02:48:55,677 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= 1 (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_57)) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1))))) is different from false [2025-01-09 02:48:55,679 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= 1 (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_57)) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1))))) is different from true [2025-01-09 02:48:55,723 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= 1 (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_57)) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1))))) is different from false [2025-01-09 02:48:55,725 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= 1 (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_57)) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1))))) is different from true [2025-01-09 02:48:55,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:55,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 80 treesize of output 57 [2025-01-09 02:48:55,785 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 02:48:55,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2025-01-09 02:48:55,810 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-01-09 02:48:55,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 47 [2025-01-09 02:48:55,843 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (let ((.cse3 (= .cse2 .cse1))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0))) |v_#valid_BEFORE_CALL_16|) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_57) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1) .cse3) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2025-01-09 02:48:55,846 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (let ((.cse3 (= .cse2 .cse1))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0))) |v_#valid_BEFORE_CALL_16|) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_57) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1) .cse3) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2025-01-09 02:48:55,910 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (let ((.cse1 (= .cse2 .cse0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_57) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse5 (select |v_#valid_BEFORE_CALL_16| .cse5))) |v_#valid_BEFORE_CALL_16|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2025-01-09 02:48:55,913 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (let ((.cse1 (= .cse2 .cse0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_57) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse5 (select |v_#valid_BEFORE_CALL_16| .cse5))) |v_#valid_BEFORE_CALL_16|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2025-01-09 02:48:55,968 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (let ((.cse1 (= .cse2 .cse0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_57) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse5 (select |v_#valid_BEFORE_CALL_16| .cse5))) |v_#valid_BEFORE_CALL_16|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0))))))) is different from false [2025-01-09 02:48:55,971 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (let ((.cse1 (= .cse2 .cse0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_57) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse5 (select |v_#valid_BEFORE_CALL_16| .cse5))) |v_#valid_BEFORE_CALL_16|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0))))))) is different from true [2025-01-09 02:48:56,130 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4)) (.cse3 (= .cse0 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse1 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse3) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_57) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse6 (select |v_#valid_BEFORE_CALL_16| .cse6))) |v_#valid_BEFORE_CALL_16|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 0))))))) is different from false [2025-01-09 02:48:56,133 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4)) (.cse3 (= .cse0 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse1 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse3) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_57) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse6 (select |v_#valid_BEFORE_CALL_16| .cse6))) |v_#valid_BEFORE_CALL_16|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 0))))))) is different from true [2025-01-09 02:48:56,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:56,269 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2025-01-09 02:48:56,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 191 treesize of output 122 [2025-01-09 02:48:56,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:56,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2025-01-09 02:48:56,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:56,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:56,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 38 [2025-01-09 02:48:56,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 35 [2025-01-09 02:48:56,330 INFO L349 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2025-01-09 02:48:56,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 74 [2025-01-09 02:48:56,334 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 02:48:56,357 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_57) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4))) |v_#valid_BEFORE_CALL_16|) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 0)))))) is different from false [2025-01-09 02:48:56,360 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_57) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4))) |v_#valid_BEFORE_CALL_16|) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 0)))))) is different from true [2025-01-09 02:48:56,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:56,384 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 99 treesize of output 67 [2025-01-09 02:48:56,396 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 02:48:56,396 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 15 treesize of output 7 [2025-01-09 02:48:56,418 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0))) |v_#valid_BEFORE_CALL_16|) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0))) (or (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_int#1| .cse1) 0) 1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from false [2025-01-09 02:48:56,420 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0))) |v_#valid_BEFORE_CALL_16|) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0))) (or (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_int#1| .cse1) 0) 1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from true [2025-01-09 02:48:56,450 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 36 treesize of output 20 [2025-01-09 02:48:56,454 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 7 treesize of output 3 [2025-01-09 02:48:56,479 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0))) |v_#valid_BEFORE_CALL_16|) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2025-01-09 02:48:56,481 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0))) |v_#valid_BEFORE_CALL_16|) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2025-01-09 02:48:56,518 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2025-01-09 02:48:56,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:48:56,593 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1507 Int) (v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1506 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_1507)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1500) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1506) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1504) .cse0) .cse1)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1503) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1501) .cse0) .cse1))))) is different from false [2025-01-09 02:49:04,821 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1507 Int) (v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1506 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) (+ (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 4) v_ArrVal_1507)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1500) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1506) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1504) .cse3) .cse4)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1503) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1501) .cse3) .cse4)))))) is different from false [2025-01-09 02:49:04,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445630939] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:04,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:49:04,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 49 [2025-01-09 02:49:04,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751915232] [2025-01-09 02:49:04,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:49:04,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-01-09 02:49:04,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:04,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-01-09 02:49:04,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1244, Unknown=99, NotChecked=1602, Total=3080 [2025-01-09 02:49:04,994 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 49 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 40 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:49:19,201 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (let ((.cse1 (= .cse2 1))) (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse0 (select |c_#memory_int#1| .cse0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse0)))) .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_create_~data#1| 1) .cse1 (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))))) is different from false [2025-01-09 02:49:19,204 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (let ((.cse1 (= .cse2 1))) (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse0 (select |c_#memory_int#1| .cse0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse0)))) .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_create_~data#1| 1) .cse1 (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))))) is different from true [2025-01-09 02:49:19,207 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (or .cse2 (= .cse3 1)) (not .cse2) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) 0)) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) is different from false [2025-01-09 02:49:19,209 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (or .cse2 (= .cse3 1)) (not .cse2) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) 0)) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) is different from true [2025-01-09 02:49:19,212 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse4 (select (select |c_#memory_int#1| .cse2) 0))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |c_#valid| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse0) (or (= .cse4 1) .cse0) .cse1 (= |c_ULTIMATE.start_main_~data~0#1| .cse4)))) is different from false [2025-01-09 02:49:19,214 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse4 (select (select |c_#memory_int#1| .cse2) 0))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse3 (select |c_#valid| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse0) (or (= .cse4 1) .cse0) .cse1 (= |c_ULTIMATE.start_main_~data~0#1| .cse4)))) is different from true [2025-01-09 02:49:19,217 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (select (select |c_#memory_int#1| .cse0) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse1) (or .cse1 (= .cse2 1)) (or .cse1 .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) .cse3 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2025-01-09 02:49:19,219 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (select (select |c_#memory_int#1| .cse0) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse1) (or .cse1 (= .cse2 1)) (or .cse1 .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) .cse3 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2025-01-09 02:49:19,222 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0)) (.cse4 (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse3 (select (select |c_#memory_int#1| .cse0) 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) .cse2 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse3 1) .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse4) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or .cse2 .cse4) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse3)))) is different from false [2025-01-09 02:49:19,224 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0)) (.cse4 (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse3 (select (select |c_#memory_int#1| .cse0) 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) .cse2 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse3 1) .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse4) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or .cse2 .cse4) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse3)))) is different from true [2025-01-09 02:49:19,228 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (= .cse3 .cse5)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse2) 1) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse2)) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) .cse4) (= (select |c_#valid| .cse5) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse6 (select |c_#valid| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_22| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse5) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) .cse4) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse2) 0)))))) is different from false [2025-01-09 02:49:19,229 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (= .cse3 .cse5)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse2) 1) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse2)) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) .cse4) (= (select |c_#valid| .cse5) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_22| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_22| .cse6 (select |c_#valid| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_22| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse5) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) .cse4) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse2) 0)))))) is different from true [2025-01-09 02:49:19,236 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= 1 (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_57)) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1))))) is different from false [2025-01-09 02:49:19,237 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1)))) (= 1 (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_57)) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1))))) is different from true [2025-01-09 02:49:19,243 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|)) (.cse3 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse1 (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| .cse1)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| .cse2 (select |c_#memory_int#1| .cse2))) (or (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= .cse2 |c_node_create_#res#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse3) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse3 (select |c_#memory_$Pointer$#1.offset| .cse3))) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= 1 (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_57)) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) (= |c_node_create_#in~data#1| (select .cse1 0)))) is different from false [2025-01-09 02:49:19,247 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|)) (.cse3 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse1 (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| .cse1)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| .cse2 (select |c_#memory_int#1| .cse2))) (or (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= .cse2 |c_node_create_#res#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse3) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse3 (select |c_#memory_$Pointer$#1.offset| .cse3))) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_22| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= 1 (select |v_old(#valid)_AFTER_CALL_22| v_arrayElimCell_57)) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) (= |c_node_create_#in~data#1| (select .cse1 0)))) is different from true [2025-01-09 02:49:19,256 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (let ((.cse5 (= .cse4 .cse3)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= .cse0 .cse1)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2))) |v_#valid_BEFORE_CALL_16|) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse3) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4) (= (select (select |c_#memory_int#1| .cse4) 0) 1) .cse5) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_24| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_57) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3) .cse5) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 0)))))) is different from false [2025-01-09 02:49:19,259 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (let ((.cse5 (= .cse4 .cse3)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= .cse0 .cse1)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2))) |v_#valid_BEFORE_CALL_16|) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse3) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4) (= (select (select |c_#memory_int#1| .cse4) 0) 1) .cse5) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_24| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_57) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3) .cse5) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 0)))))) is different from true [2025-01-09 02:49:19,268 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse3 (= .cse4 .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse3) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse4) 0) 1) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_24| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_57) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse7 (select |v_#valid_BEFORE_CALL_16| .cse7))) |v_#valid_BEFORE_CALL_16|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 0)))))) is different from false [2025-01-09 02:49:19,271 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse3 (= .cse4 .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse3) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse4) 0) 1) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_24| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_57) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse7 (select |v_#valid_BEFORE_CALL_16| .cse7))) |v_#valid_BEFORE_CALL_16|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 0)))))) is different from true [2025-01-09 02:49:19,281 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse3 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse4 (= .cse5 .cse1))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse4) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse5) 0) 1) .cse4) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_24| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_57) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse8 (select |v_#valid_BEFORE_CALL_16| .cse8))) |v_#valid_BEFORE_CALL_16|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 0)))))))) is different from false [2025-01-09 02:49:19,284 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse3 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse4 (= .cse5 .cse1))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse2) 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse4) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse5) 0) 1) .cse4) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_24| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_57) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse8 (select |v_#valid_BEFORE_CALL_16| .cse8))) |v_#valid_BEFORE_CALL_16|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 0)))))))) is different from true [2025-01-09 02:49:19,297 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse10 0))) (let ((.cse1 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4)) (.cse6 (= .cse2 .cse5)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse3 4)) (or (= .cse4 0) (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse6) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse4) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse6) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_24| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_57) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse8) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse9 (select |v_#valid_BEFORE_CALL_16| .cse9))) |v_#valid_BEFORE_CALL_16|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse5) 0))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse3))))))) is different from false [2025-01-09 02:49:19,300 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse10 0))) (let ((.cse1 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4)) (.cse6 (= .cse2 .cse5)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse3 4)) (or (= .cse4 0) (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse6) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse4) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse6) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_24| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_57) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse8) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse9 (select |v_#valid_BEFORE_CALL_16| .cse9))) |v_#valid_BEFORE_CALL_16|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse5) 0))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse3))))))) is different from true [2025-01-09 02:49:19,319 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= .cse1 .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_57) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4)))) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse7 (select |v_#valid_BEFORE_CALL_16| .cse7))) |v_#valid_BEFORE_CALL_16|) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 0))))))) is different from false [2025-01-09 02:49:19,321 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= .cse1 .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_15| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_24| v_arrayElimCell_57) 1) (= (select |v_old(#valid)_AFTER_CALL_24| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4)))) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse7 (select |v_#valid_BEFORE_CALL_16| .cse7))) |v_#valid_BEFORE_CALL_16|) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_22| .cse2) 0))))))) is different from true [2025-01-09 02:49:19,332 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select |c_#memory_int#1| .cse1)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0))) |v_#valid_BEFORE_CALL_16|) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0))) (or (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select .cse2 0) 1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 .cse3)) (= .cse3 0) (= |c_ULTIMATE.start_main_~data~0#1| 1)))) is different from false [2025-01-09 02:49:19,334 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select |c_#memory_int#1| .cse1)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0))) |v_#valid_BEFORE_CALL_16|) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0))) (or (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select .cse2 0) 1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 .cse3)) (= .cse3 0) (= |c_ULTIMATE.start_main_~data~0#1| 1)))) is different from true [2025-01-09 02:49:19,366 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0))) |v_#valid_BEFORE_CALL_16|) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= (select .cse1 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from false [2025-01-09 02:49:19,368 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_25| Int) (|v_old(#valid)_AFTER_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_22| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0))) |v_#valid_BEFORE_CALL_16|) (= (select |v_old(#valid)_AFTER_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_25|) 0) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= (select .cse1 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from true [2025-01-09 02:49:19,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:19,488 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2025-01-09 02:49:19,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 02:49:19,488 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 40 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2025-01-09 02:49:19,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:19,489 INFO L225 Difference]: With dead ends: 76 [2025-01-09 02:49:19,489 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 02:49:19,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 33 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=187, Invalid=1534, Unknown=133, NotChecked=3696, Total=5550 [2025-01-09 02:49:19,491 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1787 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:19,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 441 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 455 Invalid, 0 Unknown, 1787 Unchecked, 0.4s Time] [2025-01-09 02:49:19,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 02:49:19,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-01-09 02:49:19,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:49:19,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2025-01-09 02:49:19,506 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 44 [2025-01-09 02:49:19,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:19,506 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2025-01-09 02:49:19,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 40 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:49:19,506 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2025-01-09 02:49:19,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 02:49:19,507 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:19,507 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:19,515 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-01-09 02:49:19,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:19,710 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:19,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:19,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1985042721, now seen corresponding path program 2 times [2025-01-09 02:49:19,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:19,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531340806] [2025-01-09 02:49:19,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:49:19,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:19,727 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-01-09 02:49:19,756 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 02:49:19,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:49:19,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:21,216 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:21,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:21,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531340806] [2025-01-09 02:49:21,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531340806] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:21,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372897569] [2025-01-09 02:49:21,216 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:49:21,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:21,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:21,218 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-01-09 02:49:21,219 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-01-09 02:49:21,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-01-09 02:49:21,374 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 02:49:21,374 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:49:21,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:21,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 123 conjuncts are in the unsatisfiable core [2025-01-09 02:49:21,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:21,411 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-01-09 02:49:21,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 02:49:21,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 02:49:21,720 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:49:21,721 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 17 treesize of output 21 [2025-01-09 02:49:21,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-01-09 02:49:21,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-01-09 02:49:21,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-01-09 02:49:21,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-01-09 02:49:21,810 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-01-09 02:49:21,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-01-09 02:49:21,894 INFO L349 Elim1Store]: treesize reduction 63, result has 10.0 percent of original size [2025-01-09 02:49:21,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 99 [2025-01-09 02:49:21,906 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2025-01-09 02:49:21,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 66 [2025-01-09 02:49:22,170 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-01-09 02:49:22,170 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 37 [2025-01-09 02:49:22,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 02:49:22,176 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-01-09 02:49:22,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:22,399 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-01-09 02:49:22,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 71 [2025-01-09 02:49:22,423 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2025-01-09 02:49:22,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 71 [2025-01-09 02:49:22,438 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 29 treesize of output 25 [2025-01-09 02:49:22,472 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 15 treesize of output 3 [2025-01-09 02:49:22,503 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-09 02:49:22,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-01-09 02:49:22,684 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 02:49:22,684 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 15 treesize of output 7 [2025-01-09 02:49:22,843 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-01-09 02:49:22,843 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 32 [2025-01-09 02:49:22,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 02:49:22,898 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:22,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:49:23,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372897569] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:23,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:49:23,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 51 [2025-01-09 02:49:23,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025021208] [2025-01-09 02:49:23,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:49:23,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-01-09 02:49:23,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:23,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-01-09 02:49:23,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2935, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 02:49:23,254 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 51 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 41 states have internal predecessors, (76), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:49:25,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:25,374 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2025-01-09 02:49:25,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 02:49:25,374 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 41 states have internal predecessors, (76), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 45 [2025-01-09 02:49:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:25,375 INFO L225 Difference]: With dead ends: 94 [2025-01-09 02:49:25,375 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 02:49:25,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=302, Invalid=5860, Unknown=0, NotChecked=0, Total=6162 [2025-01-09 02:49:25,376 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:25,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 388 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 02:49:25,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 02:49:25,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2025-01-09 02:49:25,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 65 states have internal predecessors, (72), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:49:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2025-01-09 02:49:25,385 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 45 [2025-01-09 02:49:25,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:25,385 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2025-01-09 02:49:25,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 41 states have internal predecessors, (76), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:49:25,386 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2025-01-09 02:49:25,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 02:49:25,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:25,386 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1] [2025-01-09 02:49:25,397 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-01-09 02:49:25,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:25,587 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:25,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:25,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1639479337, now seen corresponding path program 1 times [2025-01-09 02:49:25,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:25,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136135805] [2025-01-09 02:49:25,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:25,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:25,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 02:49:25,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 02:49:25,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:25,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:26,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:26,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136135805] [2025-01-09 02:49:26,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136135805] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:26,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343146068] [2025-01-09 02:49:26,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:26,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:26,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:26,937 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-01-09 02:49:26,937 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-01-09 02:49:27,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 02:49:27,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 02:49:27,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:27,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:27,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-01-09 02:49:27,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:27,376 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 5 [2025-01-09 02:49:27,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 9 treesize of output 3 [2025-01-09 02:49:27,739 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 8 treesize of output 1 [2025-01-09 02:49:27,742 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 8 treesize of output 1 [2025-01-09 02:49:27,810 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 02:49:27,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 15 treesize of output 15 [2025-01-09 02:49:28,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:28,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:28,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 107 [2025-01-09 02:49:28,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 91 [2025-01-09 02:49:28,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:28,379 INFO L349 Elim1Store]: treesize reduction 176, result has 5.9 percent of original size [2025-01-09 02:49:28,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 571 treesize of output 292 [2025-01-09 02:49:28,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:28,405 INFO L349 Elim1Store]: treesize reduction 150, result has 6.8 percent of original size [2025-01-09 02:49:28,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 362 treesize of output 177 [2025-01-09 02:49:28,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:28,697 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 441 treesize of output 333 [2025-01-09 02:49:28,703 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 02:49:28,703 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 15 treesize of output 7 [2025-01-09 02:49:29,594 INFO L349 Elim1Store]: treesize reduction 64, result has 88.3 percent of original size [2025-01-09 02:49:29,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 377 treesize of output 648 [2025-01-09 02:49:29,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:29,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 525 treesize of output 636