./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:09:25,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:09:25,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:09:25,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:09:25,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:09:25,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:09:25,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:09:25,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:09:25,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:09:25,911 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:09:25,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:09:25,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:09:25,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:09:25,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:09:25,913 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:09:25,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:09:25,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:09:25,914 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:09:25,914 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:09:25,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:09:25,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:09:25,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:09:25,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:09:25,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:09:25,916 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:09:25,916 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:09:25,917 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:09:25,917 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:09:25,920 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:09:25,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:09:25,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:09:25,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:09:25,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:09:25,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:09:25,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:09:25,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:09:25,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:09:25,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:09:25,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:09:25,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:09:25,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:09:25,923 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:09:25,924 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2024-11-09 22:09:26,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:09:26,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:09:26,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:09:26,195 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:09:26,195 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:09:26,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2024-11-09 22:09:27,693 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:09:27,937 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:09:27,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2024-11-09 22:09:27,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dad38fcf/dfec87bcb82e4bbebf37bdbfb91e8d5b/FLAGe414d3cf2 [2024-11-09 22:09:27,965 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dad38fcf/dfec87bcb82e4bbebf37bdbfb91e8d5b [2024-11-09 22:09:27,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:09:27,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:09:27,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:09:27,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:09:27,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:09:27,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:09:27" (1/1) ... [2024-11-09 22:09:27,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63653eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:27, skipping insertion in model container [2024-11-09 22:09:27,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:09:27" (1/1) ... [2024-11-09 22:09:28,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:09:28,384 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2024-11-09 22:09:28,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:09:28,407 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:09:28,509 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2024-11-09 22:09:28,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:09:28,547 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:09:28,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:28 WrapperNode [2024-11-09 22:09:28,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:09:28,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:09:28,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:09:28,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:09:28,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:28" (1/1) ... [2024-11-09 22:09:28,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:28" (1/1) ... [2024-11-09 22:09:28,597 INFO L138 Inliner]: procedures = 127, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 133 [2024-11-09 22:09:28,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:09:28,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:09:28,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:09:28,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:09:28,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:28" (1/1) ... [2024-11-09 22:09:28,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:28" (1/1) ... [2024-11-09 22:09:28,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:28" (1/1) ... [2024-11-09 22:09:28,631 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 6, 12]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2024-11-09 22:09:28,632 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:28" (1/1) ... [2024-11-09 22:09:28,632 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:28" (1/1) ... [2024-11-09 22:09:28,639 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:28" (1/1) ... [2024-11-09 22:09:28,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:28" (1/1) ... [2024-11-09 22:09:28,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:28" (1/1) ... [2024-11-09 22:09:28,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:28" (1/1) ... [2024-11-09 22:09:28,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:09:28,647 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:09:28,647 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:09:28,648 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:09:28,648 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:28" (1/1) ... [2024-11-09 22:09:28,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:09:28,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:28,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 22:09:28,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 22:09:28,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 22:09:28,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 22:09:28,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 22:09:28,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 22:09:28,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 22:09:28,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 22:09:28,739 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 22:09:28,739 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 22:09:28,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 22:09:28,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:09:28,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 22:09:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 22:09:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 22:09:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 22:09:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 22:09:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 22:09:28,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 22:09:28,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 22:09:28,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 22:09:28,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 22:09:28,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 22:09:28,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:09:28,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 22:09:28,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 22:09:28,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:09:28,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:09:28,873 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:09:28,874 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:09:29,053 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L614: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2024-11-09 22:09:29,069 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: assume true;havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2024-11-09 22:09:29,082 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-09 22:09:29,082 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:09:29,100 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:09:29,102 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:09:29,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:09:29 BoogieIcfgContainer [2024-11-09 22:09:29,103 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:09:29,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:09:29,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:09:29,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:09:29,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:09:27" (1/3) ... [2024-11-09 22:09:29,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2d71f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:09:29, skipping insertion in model container [2024-11-09 22:09:29,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:28" (2/3) ... [2024-11-09 22:09:29,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2d71f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:09:29, skipping insertion in model container [2024-11-09 22:09:29,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:09:29" (3/3) ... [2024-11-09 22:09:29,112 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2024-11-09 22:09:29,130 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:09:29,130 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:09:29,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:09:29,196 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;@71a24af2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:09:29,196 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:09:29,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 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) [2024-11-09 22:09:29,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 22:09:29,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:29,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:29,210 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:29,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:29,215 INFO L85 PathProgramCache]: Analyzing trace with hash 790073030, now seen corresponding path program 1 times [2024-11-09 22:09:29,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:29,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979991271] [2024-11-09 22:09:29,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:29,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:29,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 22:09:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:29,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:09:29,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:29,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979991271] [2024-11-09 22:09:29,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979991271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:09:29,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:09:29,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:09:29,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634082700] [2024-11-09 22:09:29,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:09:29,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:09:29,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:29,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:09:29,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:09:29,565 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 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 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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) [2024-11-09 22:09:29,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:29,622 INFO L93 Difference]: Finished difference Result 69 states and 94 transitions. [2024-11-09 22:09:29,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:09:29,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 18 [2024-11-09 22:09:29,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:29,631 INFO L225 Difference]: With dead ends: 69 [2024-11-09 22:09:29,631 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 22:09:29,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:09:29,639 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:29,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:09:29,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 22:09:29,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 22:09:29,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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) [2024-11-09 22:09:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-09 22:09:29,680 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 18 [2024-11-09 22:09:29,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:29,680 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-09 22:09:29,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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) [2024-11-09 22:09:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-09 22:09:29,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 22:09:29,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:29,683 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:29,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:09:29,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:29,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:29,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1074599587, now seen corresponding path program 1 times [2024-11-09 22:09:29,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:29,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546314694] [2024-11-09 22:09:29,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:29,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:29,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:09:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:09:29,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:29,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546314694] [2024-11-09 22:09:29,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546314694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:09:29,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:09:29,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:09:29,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684133380] [2024-11-09 22:09:29,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:09:29,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:09:29,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:29,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:09:29,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:09:29,925 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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) [2024-11-09 22:09:29,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:29,980 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2024-11-09 22:09:29,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:09:29,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2024-11-09 22:09:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:29,982 INFO L225 Difference]: With dead ends: 58 [2024-11-09 22:09:29,982 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 22:09:29,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:09:29,985 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:29,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 87 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:09:29,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 22:09:29,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-09 22:09:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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) [2024-11-09 22:09:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-11-09 22:09:29,997 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 19 [2024-11-09 22:09:29,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:29,997 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-09 22:09:29,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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) [2024-11-09 22:09:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-11-09 22:09:29,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 22:09:30,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:30,000 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:30,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:09:30,000 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:30,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:30,001 INFO L85 PathProgramCache]: Analyzing trace with hash 167649031, now seen corresponding path program 1 times [2024-11-09 22:09:30,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:30,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117508145] [2024-11-09 22:09:30,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:30,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:30,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 22:09:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:30,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:09:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 22:09:30,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:30,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117508145] [2024-11-09 22:09:30,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117508145] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:30,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644827383] [2024-11-09 22:09:30,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:30,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:30,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:30,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:09:30,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 22:09:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:30,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 22:09:30,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:30,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:09:30,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:09:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 22:09:30,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644827383] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:09:30,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:09:30,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-11-09 22:09:30,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196782456] [2024-11-09 22:09:30,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:09:30,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 22:09:30,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:30,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 22:09:30,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:09:30,529 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 22:09:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:30,587 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2024-11-09 22:09:30,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:09:30,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-11-09 22:09:30,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:30,589 INFO L225 Difference]: With dead ends: 60 [2024-11-09 22:09:30,589 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 22:09:30,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:09:30,590 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:30,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 117 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:09:30,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 22:09:30,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-09 22:09:30,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 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) [2024-11-09 22:09:30,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-11-09 22:09:30,596 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2024-11-09 22:09:30,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:30,596 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-09 22:09:30,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 22:09:30,597 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-11-09 22:09:30,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 22:09:30,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:30,598 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:30,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 22:09:30,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:30,802 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:30,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:30,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1754904797, now seen corresponding path program 2 times [2024-11-09 22:09:30,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:30,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495405755] [2024-11-09 22:09:30,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:30,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:31,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 22:09:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:31,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 22:09:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:31,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:09:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 22:09:31,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:31,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495405755] [2024-11-09 22:09:31,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495405755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:31,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702839775] [2024-11-09 22:09:31,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:09:31,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:31,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:31,183 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:09:31,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 22:09:31,341 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:09:31,342 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:09:31,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 22:09:31,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:31,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 16 treesize of output 8 [2024-11-09 22:09:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:09:31,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:09:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 22:09:31,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702839775] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:09:31,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:09:31,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 13 [2024-11-09 22:09:31,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685917552] [2024-11-09 22:09:31,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:09:31,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 22:09:31,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:31,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 22:09:31,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 22:09:31,563 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 22:09:35,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:09:39,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:09:43,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:09:47,681 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] [2024-11-09 22:09:47,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:47,834 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2024-11-09 22:09:47,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 22:09:47,836 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2024-11-09 22:09:47,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:47,837 INFO L225 Difference]: With dead ends: 52 [2024-11-09 22:09:47,837 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 22:09:47,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-09 22:09:47,838 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 21 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:47,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 315 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 4 Unknown, 0 Unchecked, 16.2s Time] [2024-11-09 22:09:47,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 22:09:47,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 22:09:47,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 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) [2024-11-09 22:09:47,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-09 22:09:47,849 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 37 [2024-11-09 22:09:47,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:47,850 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-09 22:09:47,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 22:09:47,850 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-09 22:09:47,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 22:09:47,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:47,852 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:47,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 22:09:48,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 22:09:48,054 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:48,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:48,054 INFO L85 PathProgramCache]: Analyzing trace with hash 869249979, now seen corresponding path program 1 times [2024-11-09 22:09:48,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:48,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764432983] [2024-11-09 22:09:48,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:48,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:48,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 22:09:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:48,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 22:09:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:48,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:09:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 22:09:49,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:49,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764432983] [2024-11-09 22:09:49,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764432983] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:49,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39541593] [2024-11-09 22:09:49,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:49,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:49,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:49,098 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:09:49,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 22:09:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:49,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 22:09:49,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:49,278 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 [2024-11-09 22:09:49,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 22:09:49,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2024-11-09 22:09:49,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 22:09:49,619 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 22:09:49,619 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 1 case distinctions, treesize of input 27 treesize of output 30 [2024-11-09 22:09:49,635 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 12 treesize of output 4 [2024-11-09 22:09:49,649 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 22:09:49,649 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 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 22:09:49,788 INFO L349 Elim1Store]: treesize reduction 41, result has 44.6 percent of original size [2024-11-09 22:09:49,788 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2024-11-09 22:09:49,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:09:49,868 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 60 treesize of output 40 [2024-11-09 22:09:49,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-09 22:09:49,879 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 25 treesize of output 17 [2024-11-09 22:09:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 22:09:49,907 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:09:58,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39541593] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:58,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:09:58,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2024-11-09 22:09:58,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588167437] [2024-11-09 22:09:58,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:09:58,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 22:09:58,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:58,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 22:09:58,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1091, Unknown=2, NotChecked=0, Total=1190 [2024-11-09 22:09:58,355 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 31 states, 29 states have (on average 1.896551724137931) internal successors, (55), 25 states have internal predecessors, (55), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 22:10:02,974 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] [2024-11-09 22:10:03,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:10:03,534 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2024-11-09 22:10:03,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 22:10:03,535 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.896551724137931) internal successors, (55), 25 states have internal predecessors, (55), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 40 [2024-11-09 22:10:03,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:10:03,537 INFO L225 Difference]: With dead ends: 56 [2024-11-09 22:10:03,537 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 22:10:03,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=154, Invalid=1736, Unknown=2, NotChecked=0, Total=1892 [2024-11-09 22:10:03,539 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-09 22:10:03,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 501 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 504 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2024-11-09 22:10:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 22:10:03,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-11-09 22:10:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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) [2024-11-09 22:10:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-11-09 22:10:03,545 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 40 [2024-11-09 22:10:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:10:03,545 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-11-09 22:10:03,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.896551724137931) internal successors, (55), 25 states have internal predecessors, (55), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 22:10:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-11-09 22:10:03,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 22:10:03,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:03,549 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-09 22:10:03,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 22:10:03,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:03,754 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:03,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:03,754 INFO L85 PathProgramCache]: Analyzing trace with hash -748867993, now seen corresponding path program 1 times [2024-11-09 22:10:03,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:03,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485139006] [2024-11-09 22:10:03,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:03,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:05,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 22:10:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:05,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 22:10:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:05,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:10:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 22:10:05,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:05,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485139006] [2024-11-09 22:10:05,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485139006] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:05,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716091570] [2024-11-09 22:10:05,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:05,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:05,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:10:05,758 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:10:05,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 22:10:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:05,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-09 22:10:05,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:10:06,311 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 [2024-11-09 22:10:06,394 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 [2024-11-09 22:10:06,552 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 23 treesize of output 11 [2024-11-09 22:10:06,576 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 [2024-11-09 22:10:06,901 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 [2024-11-09 22:10:06,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 22:10:06,915 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 [2024-11-09 22:10:07,100 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_31| Int)) (and (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_31| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_31|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_31|) 0) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_31| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_31|))))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3|) 0) 0))) is different from true [2024-11-09 22:10:07,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:07,143 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 [2024-11-09 22:10:07,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:07,153 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 [2024-11-09 22:10:07,173 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 22:10:07,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 22:10:07,622 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-09 22:10:07,622 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 27 treesize of output 23 [2024-11-09 22:10:07,633 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 27 treesize of output 15 [2024-11-09 22:10:07,714 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 [2024-11-09 22:10:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-09 22:10:07,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:10:08,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716091570] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:08,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:10:08,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2024-11-09 22:10:08,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484701682] [2024-11-09 22:10:08,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:10:08,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-09 22:10:08,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:10:08,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-09 22:10:08,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1848, Unknown=1, NotChecked=86, Total=2070 [2024-11-09 22:10:08,431 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 42 states, 40 states have (on average 1.825) internal successors, (73), 36 states have internal predecessors, (73), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:10:10,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:10:10,081 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2024-11-09 22:10:10,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 22:10:10,081 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.825) internal successors, (73), 36 states have internal predecessors, (73), 6 states have call successors, (6), 3 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 44 [2024-11-09 22:10:10,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:10:10,083 INFO L225 Difference]: With dead ends: 65 [2024-11-09 22:10:10,083 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 22:10:10,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=259, Invalid=3404, Unknown=1, NotChecked=118, Total=3782 [2024-11-09 22:10:10,087 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 50 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 22:10:10,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 489 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 736 Invalid, 0 Unknown, 70 Unchecked, 0.8s Time] [2024-11-09 22:10:10,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 22:10:10,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 51. [2024-11-09 22:10:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 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) [2024-11-09 22:10:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2024-11-09 22:10:10,101 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 44 [2024-11-09 22:10:10,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:10:10,102 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2024-11-09 22:10:10,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.825) internal successors, (73), 36 states have internal predecessors, (73), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:10:10,103 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2024-11-09 22:10:10,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 22:10:10,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:10,105 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1] [2024-11-09 22:10:10,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 22:10:10,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:10,306 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:10,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:10,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1741992306, now seen corresponding path program 1 times [2024-11-09 22:10:10,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:10,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571935208] [2024-11-09 22:10:10,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:10,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:10,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 22:10:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:10,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 22:10:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:10,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:10:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:10,463 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 22:10:10,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:10,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571935208] [2024-11-09 22:10:10,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571935208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:10:10,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:10:10,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 22:10:10,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615388165] [2024-11-09 22:10:10,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:10:10,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 22:10:10,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:10:10,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 22:10:10,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:10:10,465 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:10:10,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:10:10,571 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2024-11-09 22:10:10,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:10:10,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-09 22:10:10,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:10:10,572 INFO L225 Difference]: With dead ends: 59 [2024-11-09 22:10:10,572 INFO L226 Difference]: Without dead ends: 53 [2024-11-09 22:10:10,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:10:10,573 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:10:10,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 124 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:10:10,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-09 22:10:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-09 22:10:10,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 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) [2024-11-09 22:10:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2024-11-09 22:10:10,580 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 45 [2024-11-09 22:10:10,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:10:10,580 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-11-09 22:10:10,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:10:10,581 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2024-11-09 22:10:10,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 22:10:10,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:10,581 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-09 22:10:10,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 22:10:10,582 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:10,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:10,582 INFO L85 PathProgramCache]: Analyzing trace with hash 700540966, now seen corresponding path program 2 times [2024-11-09 22:10:10,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:10,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004898276] [2024-11-09 22:10:10,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:10,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:12,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 22:10:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:12,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 22:10:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:13,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:10:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:13,522 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 22:10:13,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:13,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004898276] [2024-11-09 22:10:13,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004898276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:13,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696446193] [2024-11-09 22:10:13,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:10:13,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:13,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:10:13,525 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:10:13,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 22:10:13,709 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:10:13,709 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:10:13,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 152 conjuncts are in the unsatisfiable core [2024-11-09 22:10:13,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:10:13,794 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 [2024-11-09 22:10:13,920 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 [2024-11-09 22:10:14,102 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 [2024-11-09 22:10:18,236 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from false [2024-11-09 22:10:18,243 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from true [2024-11-09 22:10:18,302 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 23 treesize of output 11 [2024-11-09 22:10:18,350 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-11-09 22:10:18,350 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 23 treesize of output 22 [2024-11-09 22:10:18,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 22:10:18,370 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((|v_#memory_$Pointer$#2.offset_57| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_57|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0) 4) 0) (= (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse1 (select |v_#memory_$Pointer$#2.offset_57| .cse1)) |v_#memory_$Pointer$#2.offset_57|) (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (= (store |v_#memory_$Pointer$#2.offset_57| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_57| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)) |c_#memory_$Pointer$#2.offset|)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-09 22:10:18,374 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((|v_#memory_$Pointer$#2.offset_57| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_57|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0) 4) 0) (= (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse1 (select |v_#memory_$Pointer$#2.offset_57| .cse1)) |v_#memory_$Pointer$#2.offset_57|) (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (= (store |v_#memory_$Pointer$#2.offset_57| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_57| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)) |c_#memory_$Pointer$#2.offset|)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-11-09 22:10:18,440 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-09 22:10:18,445 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-11-09 22:10:18,530 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) is different from false [2024-11-09 22:10:18,533 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) is different from true [2024-11-09 22:10:18,585 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-09 22:10:18,590 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-09 22:10:18,612 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 29 treesize of output 13 [2024-11-09 22:10:18,620 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 [2024-11-09 22:10:18,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:18,642 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-09 22:10:18,688 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_26) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-09 22:10:18,692 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_26) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-09 22:10:18,738 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_26) 1)))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-09 22:10:18,743 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_26) 1)))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-09 22:10:18,831 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_26) 1)))) (exists ((|v_node_create_~temp~0#1.base_40| Int)) (and (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_40|))) (= (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_40|)) |c_#memory_int#2|) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_40|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_40|) 0)))) is different from false [2024-11-09 22:10:18,834 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_26) 1)))) (exists ((|v_node_create_~temp~0#1.base_40| Int)) (and (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_40|))) (= (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_40|)) |c_#memory_int#2|) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_40|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_40|) 0)))) is different from true [2024-11-09 22:10:18,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:18,951 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 37 treesize of output 26 [2024-11-09 22:10:18,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:18,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:18,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:18,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-09 22:10:18,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:18,983 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 [2024-11-09 22:10:19,034 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-09 22:10:19,039 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-09 22:10:19,130 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-09 22:10:19,133 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-09 22:10:19,215 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-09 22:10:19,219 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-09 22:10:19,382 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-09 22:10:19,386 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-09 22:10:19,584 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-09 22:10:19,590 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-09 22:10:19,685 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) |c_ULTIMATE.start_sll_append_#t~mem10#1.offset|)))) is different from false [2024-11-09 22:10:19,689 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) |c_ULTIMATE.start_sll_append_#t~mem10#1.offset|)))) is different from true [2024-11-09 22:10:19,770 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-09 22:10:19,785 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-09 22:10:19,865 INFO L349 Elim1Store]: treesize reduction 52, result has 37.3 percent of original size [2024-11-09 22:10:19,865 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 93 [2024-11-09 22:10:19,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:19,920 INFO L349 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2024-11-09 22:10:19,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 35 [2024-11-09 22:10:19,934 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 27 treesize of output 15 [2024-11-09 22:10:20,124 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (or (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))))) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (exists ((v_arrayElimIndex_2 Int)) (and (= 0 (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_2) 4)) (= (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_2) 4) .cse1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1))) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0))) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse5) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) is different from false [2024-11-09 22:10:20,128 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (or (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))))) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (exists ((v_arrayElimIndex_2 Int)) (and (= 0 (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_2) 4)) (= (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_2) 4) .cse1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1))) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0))) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse5) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) is different from true [2024-11-09 22:10:20,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:10:20,188 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 172 treesize of output 132 [2024-11-09 22:10:20,203 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 22:10:20,204 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 [2024-11-09 22:10:20,282 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (exists ((|v_node_create_~temp~0#1.base_40| Int) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= 0 (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_2) 4)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_2) 4)) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (exists ((v_prenex_2 Int) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (and (= (let ((.cse1 (@diff v_prenex_3 v_prenex_4))) (store v_prenex_3 .cse1 (select v_prenex_4 .cse1))) v_prenex_4) (= (select v_prenex_4 v_prenex_2) 0) (= (select v_prenex_4 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_3 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_3 .cse2) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from false [2024-11-09 22:10:20,288 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (exists ((|v_node_create_~temp~0#1.base_40| Int) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= 0 (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_2) 4)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_2) 4)) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (exists ((v_prenex_2 Int) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (and (= (let ((.cse1 (@diff v_prenex_3 v_prenex_4))) (store v_prenex_3 .cse1 (select v_prenex_4 .cse1))) v_prenex_4) (= (select v_prenex_4 v_prenex_2) 0) (= (select v_prenex_4 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_3 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_3 .cse2) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from true [2024-11-09 22:10:20,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:10:20,424 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 96 treesize of output 93 [2024-11-09 22:10:20,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:10:20,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 104 [2024-11-09 22:10:21,354 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (exists ((v_prenex_2 Int) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_arrayElimCell_45 Int)) (and (= (let ((.cse0 (@diff v_prenex_3 v_prenex_4))) (store v_prenex_3 .cse0 (select v_prenex_4 .cse0))) v_prenex_4) (= (select v_prenex_4 v_prenex_2) 0) (= (select v_prenex_4 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_3 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_3 v_arrayElimCell_45) 1))) (exists ((v_arrayElimIndex_2 Int)) (and (not (= v_arrayElimIndex_2 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))))) (exists ((|v_node_create_~temp~0#1.base_40| Int) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0)))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from false [2024-11-09 22:10:21,360 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (exists ((v_prenex_2 Int) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_arrayElimCell_45 Int)) (and (= (let ((.cse0 (@diff v_prenex_3 v_prenex_4))) (store v_prenex_3 .cse0 (select v_prenex_4 .cse0))) v_prenex_4) (= (select v_prenex_4 v_prenex_2) 0) (= (select v_prenex_4 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_3 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_3 v_arrayElimCell_45) 1))) (exists ((v_arrayElimIndex_2 Int)) (and (not (= v_arrayElimIndex_2 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))))) (exists ((|v_node_create_~temp~0#1.base_40| Int) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0)))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from true [2024-11-09 22:10:21,429 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 [2024-11-09 22:10:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2024-11-09 22:10:21,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:10:22,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696446193] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:22,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:10:22,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29] total 48 [2024-11-09 22:10:22,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122631353] [2024-11-09 22:10:22,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:10:22,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-09 22:10:22,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:10:22,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-09 22:10:22,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1202, Unknown=36, NotChecked=1566, Total=2970 [2024-11-09 22:10:22,436 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 48 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 40 states have internal predecessors, (71), 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) [2024-11-09 22:10:22,910 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) (and (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= .cse0 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) .cse2 (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3))) (= .cse3 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) .cse2) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1))) is different from false [2024-11-09 22:10:22,914 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) (and (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= .cse0 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) .cse2 (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3))) (= .cse3 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) .cse2) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1))) is different from true [2024-11-09 22:10:22,919 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0)) (.cse1 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0))) (and (= .cse0 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) .cse1 (= (select |c_#valid| .cse2) 1) (or (and .cse1 .cse3) (exists ((|v_#memory_$Pointer$#2.offset_57| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_57|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse2) 4) 0) (= (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse4 (select |v_#memory_$Pointer$#2.offset_57| .cse4)) |v_#memory_$Pointer$#2.offset_57|) (= .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (= (store |v_#memory_$Pointer$#2.offset_57| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_57| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)) |c_#memory_$Pointer$#2.offset|)))) .cse3 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1))) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2024-11-09 22:10:22,922 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0)) (.cse1 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0))) (and (= .cse0 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) .cse1 (= (select |c_#valid| .cse2) 1) (or (and .cse1 .cse3) (exists ((|v_#memory_$Pointer$#2.offset_57| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_57|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse2) 4) 0) (= (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse4 (select |v_#memory_$Pointer$#2.offset_57| .cse4)) |v_#memory_$Pointer$#2.offset_57|) (= .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (= (store |v_#memory_$Pointer$#2.offset_57| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_57| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)) |c_#memory_$Pointer$#2.offset|)))) .cse3 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1))) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2024-11-09 22:10:22,927 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= .cse0 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1))) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-09 22:10:22,929 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= .cse0 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1))) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-11-09 22:10:22,933 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= .cse0 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-09 22:10:22,936 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= .cse0 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-11-09 22:10:22,940 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#res#1.base|) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= .cse1 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) is different from false [2024-11-09 22:10:22,943 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#res#1.base|) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= .cse1 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) is different from true [2024-11-09 22:10:22,949 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse1 (select .cse5 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |c_#valid| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= (select |c_#valid| .cse4) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse6 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-09 22:10:22,954 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse1 (select .cse5 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select |c_#valid| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= (select |c_#valid| .cse4) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse6 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-09 22:10:22,959 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_26) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-09 22:10:22,964 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_26) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-09 22:10:22,970 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_26) 1)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-09 22:10:22,974 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_26) 1)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-09 22:10:22,987 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (@diff |c_old(#memory_int#2)| |c_#memory_int#2|))) (let ((.cse0 (store |c_old(#memory_int#2)| .cse8 (select |c_#memory_int#2| .cse8)))) (let ((.cse3 (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (.cse2 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse1 (@diff .cse0 |c_#memory_int#2|)) (.cse7 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_int#2| (store .cse0 .cse1 (select |c_#memory_int#2| .cse1))) (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (or (= (select |c_old(#valid)| .cse2) 0) .cse3) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_26) 1)))) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_node_create_~temp~0#1.base_40| Int)) (and (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_40|))) (= (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_40|)) |c_#memory_int#2|) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_40|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_40|) 0))) (or .cse3 (= .cse2 |c_node_create_#res#1.base|)) (= |c_#valid| (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6)))) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse7) 0)) (or (= .cse0 |c_#memory_int#2|) (= (select |c_old(#valid)| .cse1) 0)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse7 (select |c_#memory_$Pointer$#2.base| .cse7)) |c_#memory_$Pointer$#2.base|) (or (= (select |c_old(#valid)| .cse8) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|)))))) is different from false [2024-11-09 22:10:22,994 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (@diff |c_old(#memory_int#2)| |c_#memory_int#2|))) (let ((.cse0 (store |c_old(#memory_int#2)| .cse8 (select |c_#memory_int#2| .cse8)))) (let ((.cse3 (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (.cse2 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse1 (@diff .cse0 |c_#memory_int#2|)) (.cse7 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_int#2| (store .cse0 .cse1 (select |c_#memory_int#2| .cse1))) (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (or (= (select |c_old(#valid)| .cse2) 0) .cse3) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_26) 1)))) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_node_create_~temp~0#1.base_40| Int)) (and (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_40|))) (= (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_40|)) |c_#memory_int#2|) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_40|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_40|) 0))) (or .cse3 (= .cse2 |c_node_create_#res#1.base|)) (= |c_#valid| (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6)))) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse7) 0)) (or (= .cse0 |c_#memory_int#2|) (= (select |c_old(#valid)| .cse1) 0)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse7 (select |c_#memory_$Pointer$#2.base| .cse7)) |c_#memory_$Pointer$#2.base|) (or (= (select |c_old(#valid)| .cse8) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|)))))) is different from true [2024-11-09 22:10:23,008 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select .cse7 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) 4) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-09 22:10:23,012 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select .cse7 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) 4) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-09 22:10:23,025 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select .cse7 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) 4) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-09 22:10:23,030 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select .cse7 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) 4) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-09 22:10:23,045 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse4 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select .cse6 0) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-09 22:10:23,049 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse4 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select .cse6 0) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-09 22:10:23,062 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse4 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select .cse6 0) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-09 22:10:23,066 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse4 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select .cse6 0) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-09 22:10:23,089 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse4 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select .cse6 0) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-09 22:10:23,093 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse4 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select .cse6 0) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-09 22:10:23,106 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse4 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select .cse6 0) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-09 22:10:23,110 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse4 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse3) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 0)) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select .cse6 0) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-09 22:10:23,120 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (select .cse6 0))) (let ((.cse4 (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (not .cse1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse2) .cse3))) (and .cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3)) (not (= .cse3 4)) .cse4)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_7| .cse7))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse8) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse9) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) .cse4 (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse9) 1) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse10 (select |v_#valid_BEFORE_CALL_8| .cse10))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse9) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select .cse5 0) 0))))) is different from false [2024-11-09 22:10:23,124 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (select .cse6 0))) (let ((.cse4 (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (not .cse1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse2) .cse3))) (and .cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3)) (not (= .cse3 4)) .cse4)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_7| .cse7))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse8) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse9) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) .cse4 (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse9) 1) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse10 (select |v_#valid_BEFORE_CALL_8| .cse10))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse9) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select .cse5 0) 0))))) is different from true [2024-11-09 22:10:23,151 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (select .cse6 0))) (let ((.cse4 (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (not .cse1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse2) .cse3))) (and .cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3)) (not (= .cse3 4)) .cse4)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_7| .cse7))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse8) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse9) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) .cse4 (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse9) 1) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse10 (select |v_#valid_BEFORE_CALL_8| .cse10))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse9) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) |c_ULTIMATE.start_sll_append_#t~mem10#1.offset|))))) is different from false [2024-11-09 22:10:23,155 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (select .cse6 0))) (let ((.cse4 (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (not .cse1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse2) .cse3))) (and .cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3)) (not (= .cse3 4)) .cse4)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_7| .cse7))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse8) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse9) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) .cse4 (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse9) 1) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse10 (select |v_#valid_BEFORE_CALL_8| .cse10))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse9) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) |c_ULTIMATE.start_sll_append_#t~mem10#1.offset|))))) is different from true [2024-11-09 22:10:23,176 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (select .cse6 0))) (let ((.cse4 (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (not .cse1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse2) .cse3))) (and .cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3)) (not (= .cse3 4)) .cse4)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_7| .cse7))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse8) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse9) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) .cse4 (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse9) 1) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse10 (select |v_#valid_BEFORE_CALL_8| .cse10))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse9) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select .cse5 0) 0))))) is different from false [2024-11-09 22:10:23,180 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (select .cse6 0))) (let ((.cse4 (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (not .cse1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse2) .cse3))) (and .cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3)) (not (= .cse3 4)) .cse4)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_7| .cse7))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse8) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#2| .cse9) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) .cse4 (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse9) 1) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse10 (select |v_#valid_BEFORE_CALL_8| .cse10))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse9) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (= (select .cse5 0) 0))))) is different from true [2024-11-09 22:10:23,227 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse7 0)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (or (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))))) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (exists ((v_arrayElimIndex_2 Int)) (and (= 0 (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_2) 4)) (= (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_2) 4) .cse1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1))) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0))) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse5) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse6 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2024-11-09 22:10:23,233 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse7 0)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (or (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))))) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (exists ((v_arrayElimIndex_2 Int)) (and (= 0 (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_2) 4)) (= (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_2) 4) .cse1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1))) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0))) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_26 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_9| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_26) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse5) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse6 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from true [2024-11-09 22:10:23,261 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (exists ((|v_node_create_~temp~0#1.base_40| Int) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= 0 (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_2) 4)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_2) 4)) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (exists ((v_prenex_2 Int) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (and (= (let ((.cse2 (@diff v_prenex_3 v_prenex_4))) (store v_prenex_3 .cse2 (select v_prenex_4 .cse2))) v_prenex_4) (= (select v_prenex_4 v_prenex_2) 0) (= (select v_prenex_4 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_3 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_3 .cse3) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select .cse0 0) 1))) is different from false [2024-11-09 22:10:23,265 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (exists ((|v_node_create_~temp~0#1.base_40| Int) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= 0 (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_2) 4)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_2) 4)) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (exists ((v_prenex_2 Int) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (and (= (let ((.cse2 (@diff v_prenex_3 v_prenex_4))) (store v_prenex_3 .cse2 (select v_prenex_4 .cse2))) v_prenex_4) (= (select v_prenex_4 v_prenex_2) 0) (= (select v_prenex_4 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_3 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_3 .cse3) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select .cse0 0) 1))) is different from true [2024-11-09 22:10:23,351 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (exists ((v_prenex_2 Int) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_arrayElimCell_45 Int)) (and (= (let ((.cse1 (@diff v_prenex_3 v_prenex_4))) (store v_prenex_3 .cse1 (select v_prenex_4 .cse1))) v_prenex_4) (= (select v_prenex_4 v_prenex_2) 0) (= (select v_prenex_4 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_3 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_3 v_arrayElimCell_45) 1))) (exists ((v_arrayElimIndex_2 Int)) (and (not (= v_arrayElimIndex_2 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))))) (exists ((|v_node_create_~temp~0#1.base_40| Int) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0)))) (= (select .cse0 0) 1))) is different from false [2024-11-09 22:10:23,357 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (exists ((v_prenex_2 Int) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_arrayElimCell_45 Int)) (and (= (let ((.cse1 (@diff v_prenex_3 v_prenex_4))) (store v_prenex_3 .cse1 (select v_prenex_4 .cse1))) v_prenex_4) (= (select v_prenex_4 v_prenex_2) 0) (= (select v_prenex_4 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_3 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_3 v_arrayElimCell_45) 1))) (exists ((v_arrayElimIndex_2 Int)) (and (not (= v_arrayElimIndex_2 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0))))) (exists ((|v_node_create_~temp~0#1.base_40| Int) (v_arrayElimIndex_2 Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_2) 1) (= (select |v_#valid_BEFORE_CALL_8| |v_node_create_~temp~0#1.base_40|) 0)))) (= (select .cse0 0) 1))) is different from true [2024-11-09 22:10:23,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:10:23,412 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2024-11-09 22:10:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-09 22:10:23,413 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 40 states have internal predecessors, (71), 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 46 [2024-11-09 22:10:23,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:10:23,417 INFO L225 Difference]: With dead ends: 64 [2024-11-09 22:10:23,417 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 22:10:23,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 39 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=219, Invalid=1341, Unknown=78, NotChecked=4368, Total=6006 [2024-11-09 22:10:23,419 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 2030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1800 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 22:10:23,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 2030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 1800 Unchecked, 0.3s Time] [2024-11-09 22:10:23,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 22:10:23,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2024-11-09 22:10:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 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) [2024-11-09 22:10:23,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2024-11-09 22:10:23,434 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 46 [2024-11-09 22:10:23,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:10:23,435 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2024-11-09 22:10:23,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 40 states have internal predecessors, (71), 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) [2024-11-09 22:10:23,435 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2024-11-09 22:10:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 22:10:23,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:10:23,436 INFO L215 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, 1, 1] [2024-11-09 22:10:23,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 22:10:23,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:23,642 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:10:23,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:10:23,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1381312590, now seen corresponding path program 1 times [2024-11-09 22:10:23,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:10:23,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367315939] [2024-11-09 22:10:23,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:23,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:10:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:25,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 22:10:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:25,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 22:10:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:25,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:10:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:26,219 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 22:10:26,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:10:26,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367315939] [2024-11-09 22:10:26,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367315939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:10:26,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983241326] [2024-11-09 22:10:26,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:10:26,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:10:26,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:10:26,221 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:10:26,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 22:10:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:10:26,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 148 conjuncts are in the unsatisfiable core [2024-11-09 22:10:26,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:10:26,462 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 [2024-11-09 22:10:26,521 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 [2024-11-09 22:10:26,665 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 [2024-11-09 22:10:26,672 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 [2024-11-09 22:10:26,678 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 22:10:27,171 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 22:10:27,172 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 22:10:27,216 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 22:10:27,217 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 [2024-11-09 22:10:27,239 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 22:10:27,275 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 22:10:27,416 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 22:10:27,426 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-09 22:10:27,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:27,458 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 22:10:27,910 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 22:10:27,910 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 71 treesize of output 38 [2024-11-09 22:10:27,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 7 [2024-11-09 22:10:27,929 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 [2024-11-09 22:10:27,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 22:10:28,140 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|) 0)) (exists ((|v_node_create_~temp~0#1.base_49| Int)) (and (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_49| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_49|))) (= (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_49| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_49|)) |c_#memory_$Pointer$#2.offset|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_49|) 0) (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_49| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_49|)))))) is different from true [2024-11-09 22:10:28,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:28,202 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-09 22:10:28,202 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 79 treesize of output 56 [2024-11-09 22:10:28,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:28,227 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-11-09 22:10:28,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:28,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:28,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:28,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-09 22:10:28,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:10:28,276 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-09 22:10:28,276 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 28 treesize of output 30 [2024-11-09 22:10:29,145 INFO L349 Elim1Store]: treesize reduction 191, result has 32.7 percent of original size [2024-11-09 22:10:29,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 226 treesize of output 212 [2024-11-09 22:10:29,225 INFO L349 Elim1Store]: treesize reduction 162, result has 27.7 percent of original size [2024-11-09 22:10:29,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 186 treesize of output 178 [2024-11-09 22:10:29,261 INFO L349 Elim1Store]: treesize reduction 41, result has 44.6 percent of original size [2024-11-09 22:10:29,261 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 1 case distinctions, treesize of input 35 treesize of output 37 [2024-11-09 22:10:29,874 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 385 treesize of output 305 [2024-11-09 22:10:34,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:10:34,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 24 new quantified variables, introduced 171 case distinctions, treesize of input 507 treesize of output 2046 [2024-11-09 22:10:34,963 INFO L224 Elim1Store]: Index analysis took 230 ms [2024-11-09 22:10:36,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:10:36,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 295 treesize of output 1627