./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 12:49:23,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:49:23,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:49:23,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:49:23,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:49:23,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:49:23,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:49:23,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:49:23,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:49:23,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:49:23,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:49:23,861 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:49:23,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:49:23,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:49:23,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:49:23,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:49:23,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:49:23,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:49:23,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:49:23,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:49:23,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:49:23,886 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:49:23,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:49:23,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:49:23,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:49:23,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:49:23,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:49:23,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:49:23,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:49:23,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:49:23,895 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:49:23,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:49:23,896 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:49:23,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:49:23,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:49:23,904 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:49:23,905 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:49:23,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:49:23,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:49:23,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:49:23,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:49:23,911 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:49:23,946 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:49:23,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:49:23,951 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:49:23,951 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:49:23,952 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:49:23,952 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:49:23,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:49:23,953 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:49:23,953 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:49:23,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:49:23,954 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:49:23,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:49:23,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:49:23,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:49:23,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:49:23,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:49:23,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:49:23,955 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:49:23,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:49:23,955 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:49:23,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:49:23,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:49:23,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:49:23,956 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:49:23,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:49:23,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:49:23,957 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:49:23,957 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:49:23,957 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:49:23,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:49:23,958 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:49:23,958 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:49:23,958 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:49:23,958 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2022-11-20 12:49:24,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:49:24,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:49:24,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:49:24,313 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:49:24,313 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:49:24,314 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-11-20 12:49:27,339 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:49:27,562 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:49:27,562 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-11-20 12:49:27,573 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/data/b4aa22b84/73c878091139475ba4c1d84046de0824/FLAG02f785c46 [2022-11-20 12:49:27,587 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/data/b4aa22b84/73c878091139475ba4c1d84046de0824 [2022-11-20 12:49:27,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:49:27,592 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:49:27,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:49:27,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:49:27,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:49:27,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:49:27" (1/1) ... [2022-11-20 12:49:27,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3652b214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:27, skipping insertion in model container [2022-11-20 12:49:27,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:49:27" (1/1) ... [2022-11-20 12:49:27,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:49:27,654 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:49:28,044 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2022-11-20 12:49:28,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:49:28,067 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:49:28,134 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2022-11-20 12:49:28,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:49:28,169 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:49:28,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:28 WrapperNode [2022-11-20 12:49:28,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:49:28,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:49:28,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:49:28,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:49:28,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:28" (1/1) ... [2022-11-20 12:49:28,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:28" (1/1) ... [2022-11-20 12:49:28,248 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 122 [2022-11-20 12:49:28,248 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:49:28,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:49:28,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:49:28,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:49:28,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:28" (1/1) ... [2022-11-20 12:49:28,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:28" (1/1) ... [2022-11-20 12:49:28,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:28" (1/1) ... [2022-11-20 12:49:28,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:28" (1/1) ... [2022-11-20 12:49:28,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:28" (1/1) ... [2022-11-20 12:49:28,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:28" (1/1) ... [2022-11-20 12:49:28,302 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:28" (1/1) ... [2022-11-20 12:49:28,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:28" (1/1) ... [2022-11-20 12:49:28,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:49:28,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:49:28,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:49:28,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:49:28,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:28" (1/1) ... [2022-11-20 12:49:28,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:49:28,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:49:28,364 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:49:28,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:49:28,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 12:49:28,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:49:28,413 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-20 12:49:28,413 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-20 12:49:28,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 12:49:28,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:49:28,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:49:28,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 12:49:28,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 12:49:28,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:49:28,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 12:49:28,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:49:28,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:49:28,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:49:28,603 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:49:28,605 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:49:28,898 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:49:28,915 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:49:28,916 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-20 12:49:28,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:49:28 BoogieIcfgContainer [2022-11-20 12:49:28,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:49:28,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:49:28,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:49:28,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:49:28,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:49:27" (1/3) ... [2022-11-20 12:49:28,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f06930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:49:28, skipping insertion in model container [2022-11-20 12:49:28,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:49:28" (2/3) ... [2022-11-20 12:49:28,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f06930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:49:28, skipping insertion in model container [2022-11-20 12:49:28,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:49:28" (3/3) ... [2022-11-20 12:49:28,933 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2022-11-20 12:49:28,955 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:49:28,956 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 12:49:29,051 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:49:29,058 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@77f6ceb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:49:29,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 12:49:29,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 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) [2022-11-20 12:49:29,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 12:49:29,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:49:29,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:29,071 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:49:29,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:29,076 INFO L85 PathProgramCache]: Analyzing trace with hash 308507763, now seen corresponding path program 1 times [2022-11-20 12:49:29,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:29,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427746042] [2022-11-20 12:49:29,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:29,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:29,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 12:49:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:49:29,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:29,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427746042] [2022-11-20 12:49:29,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427746042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:29,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:49:29,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:49:29,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027040804] [2022-11-20 12:49:29,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:29,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:49:29,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:29,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:49:29,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:49:29,366 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 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.0) internal successors, (15), 2 states have internal predecessors, (15), 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) [2022-11-20 12:49:29,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:49:29,443 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2022-11-20 12:49:29,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:49:29,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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 17 [2022-11-20 12:49:29,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:49:29,455 INFO L225 Difference]: With dead ends: 57 [2022-11-20 12:49:29,455 INFO L226 Difference]: Without dead ends: 26 [2022-11-20 12:49:29,458 INFO L412 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 [2022-11-20 12:49:29,462 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:49:29,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:49:29,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-20 12:49:29,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-20 12:49:29,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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) [2022-11-20 12:49:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-11-20 12:49:29,497 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2022-11-20 12:49:29,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:49:29,497 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-11-20 12:49:29,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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) [2022-11-20 12:49:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-11-20 12:49:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 12:49:29,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:49:29,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:29,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:49:29,501 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:49:29,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:29,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2109805219, now seen corresponding path program 1 times [2022-11-20 12:49:29,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:29,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207664869] [2022-11-20 12:49:29,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:29,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:29,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 12:49:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:29,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:49:29,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:29,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207664869] [2022-11-20 12:49:29,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207664869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:29,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:49:29,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:49:29,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845586828] [2022-11-20 12:49:29,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:29,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:49:29,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:29,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:49:29,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:49:29,765 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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) [2022-11-20 12:49:29,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:49:29,824 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-11-20 12:49:29,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:49:29,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2022-11-20 12:49:29,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:49:29,826 INFO L225 Difference]: With dead ends: 50 [2022-11-20 12:49:29,826 INFO L226 Difference]: Without dead ends: 31 [2022-11-20 12:49:29,827 INFO L412 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 [2022-11-20 12:49:29,828 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:49:29,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 70 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:49:29,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-20 12:49:29,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-11-20 12:49:29,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 12:49:29,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-11-20 12:49:29,837 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2022-11-20 12:49:29,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:49:29,837 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-11-20 12:49:29,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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) [2022-11-20 12:49:29,838 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-11-20 12:49:29,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 12:49:29,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:49:29,839 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:29,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:49:29,840 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:49:29,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:29,840 INFO L85 PathProgramCache]: Analyzing trace with hash 493100305, now seen corresponding path program 1 times [2022-11-20 12:49:29,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:29,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737257476] [2022-11-20 12:49:29,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:29,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:30,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:49:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:30,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 12:49:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:49:30,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:30,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737257476] [2022-11-20 12:49:30,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737257476] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:30,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:49:30,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:49:30,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141102152] [2022-11-20 12:49:30,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:30,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:49:30,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:30,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:49:30,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:49:30,069 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-11-20 12:49:30,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:49:30,127 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-11-20 12:49:30,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:49:30,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-11-20 12:49:30,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:49:30,129 INFO L225 Difference]: With dead ends: 55 [2022-11-20 12:49:30,129 INFO L226 Difference]: Without dead ends: 31 [2022-11-20 12:49:30,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:49:30,131 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:49:30,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:49:30,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-20 12:49:30,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-11-20 12:49:30,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 12:49:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-11-20 12:49:30,137 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 27 [2022-11-20 12:49:30,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:49:30,138 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-11-20 12:49:30,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-11-20 12:49:30,138 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-11-20 12:49:30,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 12:49:30,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:49:30,139 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:30,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:49:30,140 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:49:30,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:30,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1095247597, now seen corresponding path program 1 times [2022-11-20 12:49:30,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:30,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763296161] [2022-11-20 12:49:30,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:30,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:30,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:49:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:30,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 12:49:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:30,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:49:30,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:30,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763296161] [2022-11-20 12:49:30,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763296161] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:49:30,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761178850] [2022-11-20 12:49:30,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:30,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:49:30,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:49:30,363 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:49:30,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:49:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:30,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:49:30,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:49:30,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:49:30,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:49:30,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:49:30,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761178850] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:49:30,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:49:30,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-11-20 12:49:30,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527141080] [2022-11-20 12:49:30,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:49:30,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:49:30,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:30,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:49:30,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:49:30,692 INFO L87 Difference]: Start difference. First operand 30 states and 37 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) [2022-11-20 12:49:30,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:49:30,757 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2022-11-20 12:49:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:49:30,758 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 27 [2022-11-20 12:49:30,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:49:30,759 INFO L225 Difference]: With dead ends: 51 [2022-11-20 12:49:30,759 INFO L226 Difference]: Without dead ends: 32 [2022-11-20 12:49:30,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:49:30,760 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:49:30,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 72 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:49:30,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-20 12:49:30,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-20 12:49:30,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 12:49:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-11-20 12:49:30,769 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 27 [2022-11-20 12:49:30,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:49:30,769 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-11-20 12:49:30,770 INFO L496 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) [2022-11-20 12:49:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-11-20 12:49:30,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 12:49:30,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:49:30,773 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:30,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 12:49:30,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:49:30,978 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:49:30,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:30,979 INFO L85 PathProgramCache]: Analyzing trace with hash -292922041, now seen corresponding path program 1 times [2022-11-20 12:49:30,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:30,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581072628] [2022-11-20 12:49:30,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:30,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:31,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:49:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:31,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:49:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:31,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:49:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:31,496 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 12:49:31,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:31,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581072628] [2022-11-20 12:49:31,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581072628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:49:31,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:49:31,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:49:31,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841557089] [2022-11-20 12:49:31,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:49:31,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:49:31,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:31,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:49:31,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:49:31,504 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 12:49:31,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:49:31,677 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-11-20 12:49:31,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:49:31,677 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-11-20 12:49:31,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:49:31,680 INFO L225 Difference]: With dead ends: 45 [2022-11-20 12:49:31,680 INFO L226 Difference]: Without dead ends: 42 [2022-11-20 12:49:31,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:49:31,683 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 65 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:49:31,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 130 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:49:31,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-20 12:49:31,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-11-20 12:49:31,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 12:49:31,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-11-20 12:49:31,701 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 37 [2022-11-20 12:49:31,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:49:31,701 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-11-20 12:49:31,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 12:49:31,702 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-11-20 12:49:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 12:49:31,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:49:31,702 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:31,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:49:31,703 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:49:31,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:31,703 INFO L85 PathProgramCache]: Analyzing trace with hash -292920367, now seen corresponding path program 1 times [2022-11-20 12:49:31,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:31,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162329064] [2022-11-20 12:49:31,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:31,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:32,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:49:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:32,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:49:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:32,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:49:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:32,474 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:49:32,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:32,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162329064] [2022-11-20 12:49:32,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162329064] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:49:32,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106586042] [2022-11-20 12:49:32,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:32,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:49:32,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:49:32,479 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:49:32,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:49:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:32,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-20 12:49:32,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:49:33,038 INFO L350 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 8 treesize of output 4 [2022-11-20 12:49:33,109 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_652 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_652))))) is different from true [2022-11-20 12:49:33,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:33,158 INFO L350 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 15 treesize of output 17 [2022-11-20 12:49:33,200 INFO L350 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 [2022-11-20 12:49:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-11-20 12:49:33,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:49:33,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106586042] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:49:33,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:49:33,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-11-20 12:49:33,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785760236] [2022-11-20 12:49:33,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:49:33,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 12:49:33,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:33,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 12:49:33,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=566, Unknown=5, NotChecked=48, Total=702 [2022-11-20 12:49:33,359 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 12:49:33,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:49:33,823 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-11-20 12:49:33,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:49:33,824 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2022-11-20 12:49:33,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:49:33,825 INFO L225 Difference]: With dead ends: 39 [2022-11-20 12:49:33,825 INFO L226 Difference]: Without dead ends: 32 [2022-11-20 12:49:33,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=910, Unknown=5, NotChecked=62, Total=1122 [2022-11-20 12:49:33,826 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 28 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:49:33,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 214 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 261 Invalid, 0 Unknown, 30 Unchecked, 0.2s Time] [2022-11-20 12:49:33,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-20 12:49:33,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-20 12:49:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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) [2022-11-20 12:49:33,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-11-20 12:49:33,833 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 37 [2022-11-20 12:49:33,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:49:33,834 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-11-20 12:49:33,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 12:49:33,834 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-11-20 12:49:33,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 12:49:33,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:49:33,835 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:33,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:49:34,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-20 12:49:34,036 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:49:34,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:34,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1499731437, now seen corresponding path program 1 times [2022-11-20 12:49:34,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:34,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029164143] [2022-11-20 12:49:34,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:34,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:34,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:49:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:34,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:49:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:34,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:49:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:35,030 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:49:35,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:35,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029164143] [2022-11-20 12:49:35,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029164143] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:49:35,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160552057] [2022-11-20 12:49:35,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:35,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:49:35,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:49:35,036 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:49:35,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:49:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:35,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-20 12:49:35,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:49:35,517 INFO L350 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 8 treesize of output 4 [2022-11-20 12:49:35,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:35,624 INFO L350 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 15 treesize of output 17 [2022-11-20 12:49:35,819 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-11-20 12:49:35,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2022-11-20 12:49:35,849 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-20 12:49:35,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 42 [2022-11-20 12:49:35,863 INFO L350 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 17 treesize of output 9 [2022-11-20 12:49:35,887 INFO L350 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 [2022-11-20 12:49:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:49:35,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:49:36,206 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_13| Int) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_894 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_13| v_ArrVal_899))) (let ((.cse1 (select .cse0 |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse2 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= (select (select (store (store .cse0 |ULTIMATE.start_dll_append_~last~0#1.base| (store .cse1 .cse2 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_13|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_13| v_ArrVal_894) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_13| |c_#StackHeapBarrier|)) (not (= (select .cse1 .cse2) 0)))))) is different from false [2022-11-20 12:49:36,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160552057] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:49:36,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:49:36,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2022-11-20 12:49:36,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656655721] [2022-11-20 12:49:36,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:49:36,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-20 12:49:36,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:36,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-20 12:49:36,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1078, Unknown=3, NotChecked=66, Total=1260 [2022-11-20 12:49:36,210 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-20 12:49:37,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:49:37,117 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-11-20 12:49:37,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 12:49:37,118 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2022-11-20 12:49:37,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:49:37,119 INFO L225 Difference]: With dead ends: 52 [2022-11-20 12:49:37,119 INFO L226 Difference]: Without dead ends: 49 [2022-11-20 12:49:37,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=246, Invalid=2107, Unknown=3, NotChecked=94, Total=2450 [2022-11-20 12:49:37,121 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 94 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:49:37,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 205 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 378 Invalid, 0 Unknown, 3 Unchecked, 0.3s Time] [2022-11-20 12:49:37,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-20 12:49:37,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2022-11-20 12:49:37,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 12:49:37,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-11-20 12:49:37,133 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 40 [2022-11-20 12:49:37,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:49:37,134 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-11-20 12:49:37,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-20 12:49:37,135 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-11-20 12:49:37,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 12:49:37,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:49:37,136 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:37,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:49:37,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-20 12:49:37,342 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:49:37,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:37,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1499729763, now seen corresponding path program 1 times [2022-11-20 12:49:37,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:37,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556870705] [2022-11-20 12:49:37,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:37,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:39,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:49:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:39,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:49:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:39,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:49:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:39,807 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:49:39,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:39,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556870705] [2022-11-20 12:49:39,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556870705] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:49:39,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924962260] [2022-11-20 12:49:39,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:39,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:49:39,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:49:39,816 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:49:39,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 12:49:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:40,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 126 conjunts are in the unsatisfiable core [2022-11-20 12:49:40,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:49:40,521 INFO L350 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 [2022-11-20 12:49:40,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 12:49:40,790 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 12:49:40,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 12:49:41,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:49:41,277 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 12:49:41,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-20 12:49:41,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:41,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-20 12:49:41,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 12:49:42,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2022-11-20 12:49:42,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 12:49:42,180 INFO L350 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 [2022-11-20 12:49:42,185 INFO L350 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 [2022-11-20 12:49:42,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:42,513 INFO L350 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 14 treesize of output 16 [2022-11-20 12:49:42,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:42,527 INFO L350 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 51 treesize of output 45 [2022-11-20 12:49:42,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:42,569 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-20 12:49:42,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 12:49:42,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 12:49:43,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:43,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:49:43,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 80 [2022-11-20 12:49:43,265 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-20 12:49:43,266 INFO L350 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 145 treesize of output 116 [2022-11-20 12:49:43,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:43,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2022-11-20 12:49:43,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2022-11-20 12:49:43,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 12:49:43,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:43,304 INFO L350 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 26 [2022-11-20 12:49:43,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:43,439 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:49:43,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 31 [2022-11-20 12:49:43,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 12:49:43,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 12:49:43,579 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 12:49:43,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:49:44,858 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| Int) (v_ArrVal_1151 Int) (v_ArrVal_1148 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1149 Int) (v_ArrVal_1153 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_9| Int) (v_ArrVal_1150 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1169))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1168)) (.cse4 (select .cse3 .cse1)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_9| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1167))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_1151))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1148) (select (select (store (store .cse3 .cse1 (store .cse4 .cse2 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1150) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 v_ArrVal_1149)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1153) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16|) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| |c_#StackHeapBarrier|)) (not (<= (select (select .cse5 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) |v_ULTIMATE.start_dll_append_~last~0#1.offset_9|)) (not (= (select .cse4 .cse2) 0))))))) is different from false [2022-11-20 12:49:44,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924962260] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:49:44,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:49:44,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 50 [2022-11-20 12:49:44,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512831331] [2022-11-20 12:49:44,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:49:44,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-20 12:49:44,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:44,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-20 12:49:44,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2750, Unknown=37, NotChecked=106, Total=3080 [2022-11-20 12:49:44,865 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 50 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 41 states have internal predecessors, (65), 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) [2022-11-20 12:49:46,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:49:46,182 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2022-11-20 12:49:46,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 12:49:46,183 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 41 states have internal predecessors, (65), 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 40 [2022-11-20 12:49:46,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:49:46,185 INFO L225 Difference]: With dead ends: 42 [2022-11-20 12:49:46,185 INFO L226 Difference]: Without dead ends: 40 [2022-11-20 12:49:46,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=296, Invalid=3830, Unknown=38, NotChecked=126, Total=4290 [2022-11-20 12:49:46,191 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 38 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:49:46,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 286 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 607 Invalid, 0 Unknown, 82 Unchecked, 0.6s Time] [2022-11-20 12:49:46,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-20 12:49:46,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-11-20 12:49:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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) [2022-11-20 12:49:46,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-11-20 12:49:46,215 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 40 [2022-11-20 12:49:46,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:49:46,218 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-11-20 12:49:46,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 41 states have internal predecessors, (65), 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) [2022-11-20 12:49:46,219 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-11-20 12:49:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 12:49:46,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:49:46,221 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:46,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:49:46,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:49:46,440 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:49:46,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:46,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1868742190, now seen corresponding path program 1 times [2022-11-20 12:49:46,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:46,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261260771] [2022-11-20 12:49:46,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:46,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:47,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:49:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:47,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:49:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:47,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:49:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:47,780 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:49:47,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:47,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261260771] [2022-11-20 12:49:47,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261260771] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:49:47,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506779530] [2022-11-20 12:49:47,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:47,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:49:47,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:49:47,782 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:49:47,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 12:49:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:48,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-20 12:49:48,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:49:48,034 INFO L350 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 [2022-11-20 12:49:48,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 12:49:48,181 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:49:48,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 12:49:48,348 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 12:49:48,348 INFO L350 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 11 treesize of output 7 [2022-11-20 12:49:48,495 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-20 12:49:48,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-11-20 12:49:48,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 12:49:48,723 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:49:48,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-20 12:49:49,130 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 12:49:49,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 30 [2022-11-20 12:49:49,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 12:49:49,154 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 12:49:49,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 12:49:49,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:49,333 INFO L350 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 14 treesize of output 16 [2022-11-20 12:49:49,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:49,351 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 12:49:49,352 INFO L350 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 73 treesize of output 61 [2022-11-20 12:49:49,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:49,379 INFO L321 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2022-11-20 12:49:49,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2022-11-20 12:49:49,792 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-20 12:49:49,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2022-11-20 12:49:49,841 INFO L321 Elim1Store]: treesize reduction 90, result has 14.3 percent of original size [2022-11-20 12:49:49,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 60 [2022-11-20 12:49:49,882 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 12:49:49,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 102 [2022-11-20 12:49:49,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:49,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 12:49:49,904 INFO L350 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 38 treesize of output 26 [2022-11-20 12:49:49,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 12:49:50,066 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 12:49:50,066 INFO L350 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 56 treesize of output 23 [2022-11-20 12:49:50,102 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 12:49:50,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:49:50,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506779530] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:49:50,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:49:50,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 46 [2022-11-20 12:49:50,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793540416] [2022-11-20 12:49:50,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:49:50,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-20 12:49:50,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:50,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-20 12:49:50,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2557, Unknown=3, NotChecked=0, Total=2756 [2022-11-20 12:49:50,871 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 46 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 38 states have internal predecessors, (68), 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) [2022-11-20 12:49:52,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:49:52,359 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-11-20 12:49:52,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 12:49:52,359 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 38 states have internal predecessors, (68), 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 42 [2022-11-20 12:49:52,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:49:52,360 INFO L225 Difference]: With dead ends: 71 [2022-11-20 12:49:52,360 INFO L226 Difference]: Without dead ends: 40 [2022-11-20 12:49:52,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=344, Invalid=3943, Unknown=3, NotChecked=0, Total=4290 [2022-11-20 12:49:52,363 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 57 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:49:52,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 285 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 483 Invalid, 0 Unknown, 33 Unchecked, 0.5s Time] [2022-11-20 12:49:52,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-20 12:49:52,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-11-20 12:49:52,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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) [2022-11-20 12:49:52,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-11-20 12:49:52,373 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 42 [2022-11-20 12:49:52,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:49:52,374 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-11-20 12:49:52,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 38 states have internal predecessors, (68), 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) [2022-11-20 12:49:52,374 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-11-20 12:49:52,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 12:49:52,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:49:52,375 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:49:52,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 12:49:52,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:49:52,591 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:49:52,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:49:52,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1422189688, now seen corresponding path program 1 times [2022-11-20 12:49:52,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:49:52,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020509055] [2022-11-20 12:49:52,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:52,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:49:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:54,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:49:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:54,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:49:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:55,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:49:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:49:55,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:49:55,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020509055] [2022-11-20 12:49:55,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020509055] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:49:55,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371560476] [2022-11-20 12:49:55,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:49:55,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:49:55,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:49:55,455 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:49:55,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 12:49:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:49:55,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 128 conjunts are in the unsatisfiable core [2022-11-20 12:49:55,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:49:55,894 INFO L350 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 [2022-11-20 12:49:55,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 12:49:56,138 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 12:49:56,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 12:49:56,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:49:56,582 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 12:49:56,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-20 12:49:56,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 12:49:56,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:56,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-20 12:49:56,880 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:49:56,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-11-20 12:49:56,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 12:49:57,449 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:49:57,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 37 [2022-11-20 12:49:57,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 12:49:57,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 12:49:57,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:57,722 INFO L350 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 14 treesize of output 16 [2022-11-20 12:49:57,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:57,745 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 12:49:57,745 INFO L350 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 84 treesize of output 70 [2022-11-20 12:49:57,773 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 12:49:57,774 INFO L350 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 18 treesize of output 28 [2022-11-20 12:49:57,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 12:49:57,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:57,804 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 12:49:57,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-20 12:49:58,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:58,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:49:58,780 INFO L321 Elim1Store]: treesize reduction 139, result has 14.7 percent of original size [2022-11-20 12:49:58,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 210 treesize of output 104 [2022-11-20 12:49:58,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:58,828 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 12:49:58,828 INFO L350 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 167 treesize of output 135 [2022-11-20 12:49:58,850 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-20 12:49:58,851 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 104 [2022-11-20 12:49:58,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:58,860 INFO L350 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 95 treesize of output 89 [2022-11-20 12:49:58,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2022-11-20 12:49:58,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:49:58,975 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:49:58,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 30 [2022-11-20 12:49:58,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 12:49:59,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 12:49:59,115 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 12:49:59,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:49:59,132 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1684 Int) (v_ArrVal_1685 Int) (v_ArrVal_1683 (Array Int Int)) (v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1680 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1680) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1682) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1685)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1681) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1684)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1683) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-20 12:49:59,969 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| Int) (v_ArrVal_1684 Int) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1695 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_12| Int) (v_ArrVal_1694 (Array Int Int)) (v_ArrVal_1685 Int) (v_ArrVal_1683 (Array Int Int)) (v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1680 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1695)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1694))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse2 (select .cse1 .cse0)) (.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_12| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1696) .cse0 v_ArrVal_1680) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1682) (select (select (store (store .cse1 .cse0 (store .cse2 .cse3 v_ArrVal_1685)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1681) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse0 (store (select .cse4 .cse0) .cse3 v_ArrVal_1684)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1683) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select .cse2 .cse3) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22|) 0))))))) is different from false [2022-11-20 12:49:59,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371560476] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:49:59,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:49:59,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 54 [2022-11-20 12:49:59,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948623169] [2022-11-20 12:49:59,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:49:59,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-20 12:49:59,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:49:59,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-20 12:49:59,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=3211, Unknown=5, NotChecked=230, Total=3660 [2022-11-20 12:49:59,975 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 54 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 45 states have internal predecessors, (69), 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) [2022-11-20 12:50:01,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:50:01,670 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-11-20 12:50:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 12:50:01,671 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 45 states have internal predecessors, (69), 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 42 [2022-11-20 12:50:01,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:50:01,672 INFO L225 Difference]: With dead ends: 52 [2022-11-20 12:50:01,672 INFO L226 Difference]: Without dead ends: 50 [2022-11-20 12:50:01,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1314 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=393, Invalid=4722, Unknown=5, NotChecked=282, Total=5402 [2022-11-20 12:50:01,674 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 146 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:50:01,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 213 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 625 Invalid, 0 Unknown, 4 Unchecked, 0.6s Time] [2022-11-20 12:50:01,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-20 12:50:01,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2022-11-20 12:50:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 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) [2022-11-20 12:50:01,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2022-11-20 12:50:01,686 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 42 [2022-11-20 12:50:01,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:50:01,687 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-11-20 12:50:01,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 45 states have internal predecessors, (69), 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) [2022-11-20 12:50:01,687 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-11-20 12:50:01,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-20 12:50:01,687 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:50:01,688 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:50:01,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 12:50:01,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 12:50:01,895 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:50:01,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:50:01,895 INFO L85 PathProgramCache]: Analyzing trace with hash 924724691, now seen corresponding path program 1 times [2022-11-20 12:50:01,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:50:01,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512132308] [2022-11-20 12:50:01,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:50:01,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:50:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:50:04,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:50:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:50:04,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:50:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:50:04,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:50:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:50:05,480 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:50:05,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:50:05,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512132308] [2022-11-20 12:50:05,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512132308] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:50:05,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205945077] [2022-11-20 12:50:05,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:50:05,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:50:05,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:50:05,483 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:50:05,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 12:50:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:50:05,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 151 conjunts are in the unsatisfiable core [2022-11-20 12:50:05,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:50:06,043 INFO L350 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 [2022-11-20 12:50:06,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:06,251 INFO L350 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 16 treesize of output 17 [2022-11-20 12:50:06,443 INFO L350 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 [2022-11-20 12:50:06,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 12:50:06,675 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 12:50:06,675 INFO L350 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 14 treesize of output 20 [2022-11-20 12:50:06,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 12:50:06,705 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-20 12:50:06,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2022-11-20 12:50:06,829 INFO L350 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 13 treesize of output 9 [2022-11-20 12:50:06,839 INFO L350 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 13 treesize of output 9 [2022-11-20 12:50:06,853 INFO L350 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 14 treesize of output 16 [2022-11-20 12:50:06,983 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:50:06,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 90 [2022-11-20 12:50:06,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:06,994 INFO L350 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 45 treesize of output 38 [2022-11-20 12:50:07,001 INFO L350 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 22 treesize of output 24 [2022-11-20 12:50:07,540 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:50:07,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 35 [2022-11-20 12:50:07,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:50:07,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:50:07,555 INFO L350 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 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 12:50:07,559 INFO L350 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 [2022-11-20 12:50:07,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:07,844 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 12:50:07,844 INFO L350 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 84 treesize of output 68 [2022-11-20 12:50:07,865 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-20 12:50:07,865 INFO L350 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 22 treesize of output 36 [2022-11-20 12:50:07,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 12:50:07,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:07,911 INFO L321 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2022-11-20 12:50:07,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 38 [2022-11-20 12:50:07,948 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 12:50:07,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 12:50:08,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:50:08,675 INFO L321 Elim1Store]: treesize reduction 103, result has 14.9 percent of original size [2022-11-20 12:50:08,675 INFO L350 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 204 treesize of output 108 [2022-11-20 12:50:08,715 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-20 12:50:08,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 237 treesize of output 154 [2022-11-20 12:50:08,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:08,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:08,738 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 12:50:08,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 66 [2022-11-20 12:50:08,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:08,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2022-11-20 12:50:08,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-11-20 12:50:09,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:50:09,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:09,227 INFO L321 Elim1Store]: treesize reduction 43, result has 6.5 percent of original size [2022-11-20 12:50:09,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 174 treesize of output 75 [2022-11-20 12:50:09,241 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-11-20 12:50:09,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2022-11-20 12:50:09,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 12:50:09,375 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:50:09,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:50:09,477 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1958 Int) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1961 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1961) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1956)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1964))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1958)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1963) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-11-20 12:50:09,616 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1958 Int) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_15| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0) |v_ULTIMATE.start_dll_append_~last~0#1.offset_15|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_15| 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1961) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1956)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1964))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ 4 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) .cse2 v_ArrVal_1958)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1963) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))))))) is different from false [2022-11-20 12:50:12,449 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1958 Int) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_15| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_15| 4)) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1961) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1956)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1964))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1958)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1963) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))) (not (<= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7) |v_ULTIMATE.start_dll_append_~last~0#1.offset_15|))))) is different from false [2022-11-20 12:50:12,560 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1958 Int) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_25| Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_15| Int)) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_25| v_ArrVal_1974)) (.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_25| v_ArrVal_1975))) (let ((.cse9 (select (select .cse7 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse10 (+ (select (select .cse8 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (or (= (let ((.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_15| 4)) (.cse1 (select (select .cse7 .cse9) .cse10))) (let ((.cse6 (store (store .cse8 .cse1 v_ArrVal_1961) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_25| v_ArrVal_1956)) (.cse3 (store (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_25|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_25| v_ArrVal_1964))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_25| v_ArrVal_1973))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_1958))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_25| v_ArrVal_1963) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) |c_ULTIMATE.start_main_~data~0#1|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_25|))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_25| |c_#StackHeapBarrier|)) (not (<= (select (select .cse8 .cse9) .cse10) |v_ULTIMATE.start_dll_append_~last~0#1.offset_15|)))))) is different from false [2022-11-20 12:50:12,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205945077] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:50:12,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:50:12,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 51 [2022-11-20 12:50:12,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338685498] [2022-11-20 12:50:12,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:50:12,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-20 12:50:12,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:50:12,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-20 12:50:12,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2556, Unknown=50, NotChecked=420, Total=3192 [2022-11-20 12:50:12,566 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 51 states, 49 states have (on average 1.469387755102041) internal successors, (72), 42 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 12:50:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:50:14,900 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-11-20 12:50:14,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 12:50:14,901 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.469387755102041) internal successors, (72), 42 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2022-11-20 12:50:14,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:50:14,902 INFO L225 Difference]: With dead ends: 48 [2022-11-20 12:50:14,903 INFO L226 Difference]: Without dead ends: 46 [2022-11-20 12:50:14,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=310, Invalid=4210, Unknown=52, NotChecked=540, Total=5112 [2022-11-20 12:50:14,904 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 55 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:50:14,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 267 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 628 Invalid, 0 Unknown, 40 Unchecked, 0.6s Time] [2022-11-20 12:50:14,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-20 12:50:14,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-11-20 12:50:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 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) [2022-11-20 12:50:14,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2022-11-20 12:50:14,918 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 44 [2022-11-20 12:50:14,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:50:14,919 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2022-11-20 12:50:14,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.469387755102041) internal successors, (72), 42 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 12:50:14,919 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2022-11-20 12:50:14,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-20 12:50:14,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:50:14,920 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:50:14,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-20 12:50:15,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 12:50:15,123 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:50:15,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:50:15,123 INFO L85 PathProgramCache]: Analyzing trace with hash 478170515, now seen corresponding path program 2 times [2022-11-20 12:50:15,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:50:15,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870861160] [2022-11-20 12:50:15,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:50:15,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:50:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:50:16,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:50:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:50:17,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:50:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:50:17,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:50:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:50:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:50:17,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:50:17,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870861160] [2022-11-20 12:50:17,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870861160] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:50:17,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507478244] [2022-11-20 12:50:17,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:50:17,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:50:17,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:50:17,635 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:50:17,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 12:50:17,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:50:17,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:50:17,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-20 12:50:17,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:50:18,045 INFO L350 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 [2022-11-20 12:50:18,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 12:50:18,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 12:50:18,564 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 12:50:18,564 INFO L350 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 14 treesize of output 20 [2022-11-20 12:50:18,590 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 12:50:18,590 INFO L350 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 14 treesize of output 20 [2022-11-20 12:50:18,614 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-20 12:50:18,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2022-11-20 12:50:18,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-20 12:50:18,709 INFO L350 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 14 treesize of output 16 [2022-11-20 12:50:18,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-20 12:50:18,729 INFO L350 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 14 treesize of output 16 [2022-11-20 12:50:18,843 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-20 12:50:18,844 INFO L350 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 94 treesize of output 57 [2022-11-20 12:50:18,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-11-20 12:50:19,282 INFO L321 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2022-11-20 12:50:19,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 44 [2022-11-20 12:50:19,299 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-20 12:50:19,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 21 [2022-11-20 12:50:19,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:50:19,387 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2231 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2231))) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_2230 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2230) |c_#memory_$Pointer$.base|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-20 12:50:19,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:19,439 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-20 12:50:19,439 INFO L350 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 106 [2022-11-20 12:50:19,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:19,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:19,460 INFO L321 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-11-20 12:50:19,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 110 [2022-11-20 12:50:19,491 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-20 12:50:19,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-11-20 12:50:19,839 INFO L321 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2022-11-20 12:50:19,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 74 [2022-11-20 12:50:19,863 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-11-20 12:50:19,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 32 [2022-11-20 12:50:19,920 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-11-20 12:50:19,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:50:20,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507478244] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:50:20,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:50:20,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 42 [2022-11-20 12:50:20,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059537482] [2022-11-20 12:50:20,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:50:20,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-20 12:50:20,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:50:20,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-20 12:50:20,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1859, Unknown=2, NotChecked=86, Total=2070 [2022-11-20 12:50:20,425 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 42 states, 40 states have (on average 1.625) internal successors, (65), 36 states have internal predecessors, (65), 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) [2022-11-20 12:50:22,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:50:22,737 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-11-20 12:50:22,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 12:50:22,738 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.625) internal successors, (65), 36 states have internal predecessors, (65), 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 [2022-11-20 12:50:22,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:50:22,739 INFO L225 Difference]: With dead ends: 72 [2022-11-20 12:50:22,739 INFO L226 Difference]: Without dead ends: 60 [2022-11-20 12:50:22,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=221, Invalid=3087, Unknown=2, NotChecked=112, Total=3422 [2022-11-20 12:50:22,740 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 12:50:22,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 374 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 603 Invalid, 0 Unknown, 169 Unchecked, 0.7s Time] [2022-11-20 12:50:22,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-20 12:50:22,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-11-20 12:50:22,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 12:50:22,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-11-20 12:50:22,770 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 44 [2022-11-20 12:50:22,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:50:22,772 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-11-20 12:50:22,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.625) internal successors, (65), 36 states have internal predecessors, (65), 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) [2022-11-20 12:50:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-11-20 12:50:22,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 12:50:22,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:50:22,775 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:50:22,787 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-20 12:50:22,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:50:22,988 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:50:22,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:50:22,989 INFO L85 PathProgramCache]: Analyzing trace with hash -397769244, now seen corresponding path program 1 times [2022-11-20 12:50:22,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:50:22,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399001478] [2022-11-20 12:50:22,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:50:22,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:50:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:50:25,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:50:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:50:25,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:50:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:50:25,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:50:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:50:25,988 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:50:25,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:50:25,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399001478] [2022-11-20 12:50:25,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399001478] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:50:25,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368145215] [2022-11-20 12:50:25,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:50:25,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:50:25,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:50:25,990 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:50:25,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 12:50:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:50:26,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 144 conjunts are in the unsatisfiable core [2022-11-20 12:50:26,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:50:26,846 INFO L350 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 [2022-11-20 12:50:26,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 12:50:27,069 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))))) (<= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.offset|)) is different from false [2022-11-20 12:50:27,071 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))))) (<= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.offset|)) is different from true [2022-11-20 12:50:27,094 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0))))))) is different from false [2022-11-20 12:50:27,096 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0))))))) is different from true [2022-11-20 12:50:27,150 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2022-11-20 12:50:27,153 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from true [2022-11-20 12:50:27,203 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from false [2022-11-20 12:50:27,206 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from true [2022-11-20 12:50:27,237 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from false [2022-11-20 12:50:27,240 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from true [2022-11-20 12:50:27,292 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (not (= |c_node_create_#res#1.base| 0)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from false [2022-11-20 12:50:27,294 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (not (= |c_node_create_#res#1.base| 0)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from true [2022-11-20 12:50:27,397 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from false [2022-11-20 12:50:27,401 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from true [2022-11-20 12:50:27,422 INFO L350 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 13 treesize of output 9 [2022-11-20 12:50:27,465 INFO L350 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 13 treesize of output 9 [2022-11-20 12:50:27,491 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= .cse0 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))))) is different from false [2022-11-20 12:50:27,495 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= .cse0 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))))) is different from true [2022-11-20 12:50:27,529 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:50:27,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-11-20 12:50:27,562 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 12:50:27,562 INFO L350 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 31 treesize of output 41 [2022-11-20 12:50:27,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 12:50:27,604 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (and (<= 0 .cse0) (<= .cse0 0))) (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))))) is different from false [2022-11-20 12:50:27,608 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (and (<= 0 .cse0) (<= .cse0 0))) (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))))) is different from true [2022-11-20 12:50:27,691 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (<= 0 .cse0) (<= .cse0 0))) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from false [2022-11-20 12:50:27,696 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (<= 0 .cse0) (<= .cse0 0))) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from true [2022-11-20 12:50:27,850 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| 0)) (or (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (<= .cse2 0) (<= 0 .cse2)))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from false [2022-11-20 12:50:27,854 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| 0)) (or (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (<= .cse2 0) (<= 0 .cse2)))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from true [2022-11-20 12:50:27,939 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| .cse1 1)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 0) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse1) 4))) (and (<= 0 .cse3) (<= .cse3 0))) (= .cse0 .cse1)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= 0 .cse1)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))))) is different from false [2022-11-20 12:50:27,943 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| .cse1 1)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 0) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse1) 4))) (and (<= 0 .cse3) (<= .cse3 0))) (= .cse0 .cse1)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= 0 .cse1)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))))) is different from true [2022-11-20 12:50:27,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:50:27,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 42 [2022-11-20 12:50:27,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:27,979 INFO L350 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 27 treesize of output 15 [2022-11-20 12:50:28,038 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from false [2022-11-20 12:50:28,042 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from true [2022-11-20 12:50:28,126 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from false [2022-11-20 12:50:28,130 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from true [2022-11-20 12:50:28,256 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_2484 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2484))) (not (= |c_node_create_#res#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((v_ArrVal_2485 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2485) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from false [2022-11-20 12:50:28,260 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_2484 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2484))) (not (= |c_node_create_#res#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((v_ArrVal_2485 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2485) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from true [2022-11-20 12:50:28,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:28,366 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 12:50:28,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 85 [2022-11-20 12:50:28,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:28,390 INFO L321 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2022-11-20 12:50:28,391 INFO L350 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 2 case distinctions, treesize of input 53 treesize of output 60 [2022-11-20 12:50:28,541 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse0 (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse2 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4))) |v_#valid_BEFORE_CALL_33|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= 0 .cse5) (<= .cse5 0))) (= .cse3 .cse2) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse6 (select |v_#valid_BEFORE_CALL_30| .cse6)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= 0 .cse2))))) is different from false [2022-11-20 12:50:28,547 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse0 (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse2 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_33| .cse4))) |v_#valid_BEFORE_CALL_33|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= 0 .cse5) (<= .cse5 0))) (= .cse3 .cse2) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse6 (select |v_#valid_BEFORE_CALL_30| .cse6)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= 0 .cse2))))) is different from true [2022-11-20 12:50:28,755 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= 0 .cse2) (<= .cse2 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3) (= .cse4 .cse3)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse5 (select |v_#valid_BEFORE_CALL_29| .cse5))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse3) 0) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_33| .cse6))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse3 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= 0 .cse3))))) is different from false [2022-11-20 12:50:28,761 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= 0 .cse2) (<= .cse2 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3) (= .cse4 .cse3)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse5 (select |v_#valid_BEFORE_CALL_29| .cse5))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse3) 0) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_33| .cse6))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse3 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= 0 .cse3))))) is different from true [2022-11-20 12:50:28,931 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse2 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse2) (or (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (and (<= 0 .cse3) (<= .cse3 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4) (= .cse5 .cse4)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse6 (select |v_#valid_BEFORE_CALL_29| .cse6))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse4) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse4 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (not (= 0 .cse4))))) is different from false [2022-11-20 12:50:28,937 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse2 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse2) (or (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (and (<= 0 .cse3) (<= .cse3 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4) (= .cse5 .cse4)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse6 (select |v_#valid_BEFORE_CALL_29| .cse6))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse4) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse4 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (not (= 0 .cse4))))) is different from true [2022-11-20 12:50:29,282 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse3 4)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse4 (+ .cse2 4))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse2 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse3 .cse4) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (or (let ((.cse5 (select .cse6 4))) (and (<= 0 .cse5) (<= .cse5 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse7) (= .cse8 .cse7)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse7 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= 0 .cse7)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse6 .cse4)))))) is different from false [2022-11-20 12:50:29,288 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse3 4)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse4 (+ .cse2 4))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse2 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse3 .cse4) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (or (let ((.cse5 (select .cse6 4))) (and (<= 0 .cse5) (<= .cse5 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse7) (= .cse8 .cse7)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse7 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= 0 .cse7)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse6 .cse4)))))) is different from true [2022-11-20 12:50:29,512 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse3 4)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse4 (+ .cse2 4))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse2 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse3 .cse4) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (or (let ((.cse5 (select .cse6 4))) (and (<= 0 .cse5) (<= .cse5 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse7) (= .cse8 .cse7)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse7 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= 0 .cse7)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse6 .cse4)))))) is different from false [2022-11-20 12:50:29,519 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse3 4)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse4 (+ .cse2 4))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse2 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse3 .cse4) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (or (let ((.cse5 (select .cse6 4))) (and (<= 0 .cse5) (<= .cse5 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse7) (= .cse8 .cse7)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse7 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= 0 .cse7)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse6 .cse4)))))) is different from true [2022-11-20 12:50:29,723 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse3 4)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse4 (+ .cse2 4))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse2 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse3 .cse4) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (or (let ((.cse5 (select .cse6 4))) (and (<= 0 .cse5) (<= .cse5 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse7) (= .cse8 .cse7)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse7 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (not (= 0 .cse7)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse6 .cse4)))))) is different from false [2022-11-20 12:50:29,744 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse3 4)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse4 (+ .cse2 4))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse2 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse3 .cse4) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (or (let ((.cse5 (select .cse6 4))) (and (<= 0 .cse5) (<= .cse5 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse7) (= .cse8 .cse7)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse7 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (not (= 0 .cse7)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse6 .cse4)))))) is different from true [2022-11-20 12:50:29,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:50:29,869 INFO L321 Elim1Store]: treesize reduction 145, result has 11.0 percent of original size [2022-11-20 12:50:29,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 255 treesize of output 130 [2022-11-20 12:50:29,958 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-20 12:50:29,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 397 treesize of output 282 [2022-11-20 12:50:29,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:29,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:29,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:29,996 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 12:50:29,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 327 treesize of output 223 [2022-11-20 12:50:30,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:30,051 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-20 12:50:30,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 287 treesize of output 233 [2022-11-20 12:50:30,218 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse4 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse7) (+ 4 (select .cse4 (+ .cse2 4)))))) (let ((.cse0 (+ 2 .cse6))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse3 (select .cse4 4))) (and (<= 0 .cse3) (<= .cse3 0))) (= .cse5 .cse6) (= .cse7 .cse5)) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse5 1) .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_#valid_BEFORE_CALL_33| .cse8))) |v_#valid_BEFORE_CALL_33|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (not (= 0 .cse6)) (not (= 0 .cse5))))))) is different from false [2022-11-20 12:50:30,224 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse4 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse7) (+ 4 (select .cse4 (+ .cse2 4)))))) (let ((.cse0 (+ 2 .cse6))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse3 (select .cse4 4))) (and (<= 0 .cse3) (<= .cse3 0))) (= .cse5 .cse6) (= .cse7 .cse5)) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse5 1) .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_#valid_BEFORE_CALL_33| .cse8))) |v_#valid_BEFORE_CALL_33|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (not (= 0 .cse6)) (not (= 0 .cse5))))))) is different from true [2022-11-20 12:50:30,791 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_201 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimIndex_45 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse9 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse6) (+ (select .cse9 (+ .cse4 4)) 4)))) (let ((.cse2 (select .cse9 4)) (.cse1 (+ 2 .cse8))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (<= 0 .cse2) (not (= .cse0 0)) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse4) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (not (= v_arrayElimIndex_45 0)) (= .cse4 0) (= |v_#valid_BEFORE_CALL_30| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7))) |v_#valid_BEFORE_CALL_33|) (not (= .cse8 0)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse0 1) .cse8) 0) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|))))))) is different from false [2022-11-20 12:50:30,820 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_201 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimIndex_45 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse9 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse6) (+ (select .cse9 (+ .cse4 4)) 4)))) (let ((.cse2 (select .cse9 4)) (.cse1 (+ 2 .cse8))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (<= 0 .cse2) (not (= .cse0 0)) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse4) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (not (= v_arrayElimIndex_45 0)) (= .cse4 0) (= |v_#valid_BEFORE_CALL_30| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7))) |v_#valid_BEFORE_CALL_33|) (not (= .cse8 0)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse0 1) .cse8) 0) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|))))))) is different from true [2022-11-20 12:50:31,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:31,133 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 12:50:31,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 135 [2022-11-20 12:50:31,387 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_201 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimIndex_45 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (let ((.cse4 (+ 2 .cse1))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse0 1) .cse1) 0) (not (= .cse0 0)) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (not (= .cse1 0)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (not (= v_arrayElimIndex_45 0)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_30| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 0) (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_33| .cse6))) |v_#valid_BEFORE_CALL_33|) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|))))))) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) is different from false [2022-11-20 12:50:31,393 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_201 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimIndex_45 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (let ((.cse4 (+ 2 .cse1))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse0 1) .cse1) 0) (not (= .cse0 0)) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (not (= .cse1 0)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (not (= v_arrayElimIndex_45 0)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_30| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 0) (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_33| .cse6))) |v_#valid_BEFORE_CALL_33|) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|))))))) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) is different from true [2022-11-20 12:50:31,604 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:50:31,609 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 12:50:31,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 56 [2022-11-20 12:50:31,717 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimIndex_58 Int) (v_arrayElimIndex_57 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_58) 0) (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimIndex_58) 1) (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimIndex_57) 0) (= (select (store |v_#valid_BEFORE_CALL_33| v_arrayElimIndex_57 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_33| .cse2))) |v_#valid_BEFORE_CALL_33|) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_28| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= v_arrayElimIndex_57 0)))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from false [2022-11-20 12:50:31,722 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimIndex_58 Int) (v_arrayElimIndex_57 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimIndex_58) 0) (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimIndex_58) 1) (= (select |v_#valid_BEFORE_CALL_33| v_arrayElimIndex_57) 0) (= (select (store |v_#valid_BEFORE_CALL_33| v_arrayElimIndex_57 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_33| .cse2))) |v_#valid_BEFORE_CALL_33|) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_28| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= v_arrayElimIndex_57 0)))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from true [2022-11-20 12:50:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2022-11-20 12:50:31,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:50:33,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368145215] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:50:33,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:50:33,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 31] total 54 [2022-11-20 12:50:33,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926831582] [2022-11-20 12:50:33,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:50:33,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-20 12:50:33,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:50:33,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-20 12:50:33,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1389, Unknown=52, NotChecked=2450, Total=4032 [2022-11-20 12:50:33,194 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 54 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 12:50:33,611 WARN L837 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.offset|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2022-11-20 12:50:33,613 WARN L859 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.offset|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2022-11-20 12:50:33,616 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2022-11-20 12:50:33,619 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2022-11-20 12:50:33,622 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))))) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2022-11-20 12:50:33,624 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_24| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |c_#valid| .cse0)))))) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from true [2022-11-20 12:50:33,629 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from false [2022-11-20 12:50:33,631 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from true [2022-11-20 12:50:33,635 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from false [2022-11-20 12:50:33,638 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (<= 0 |c_node_create_~temp~0#1.offset|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from true [2022-11-20 12:50:33,649 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (not (= |c_node_create_#res#1.base| 0)) (= |c_#valid| (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse2 (select |c_#valid| .cse2)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse1 |c_node_create_#res#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from false [2022-11-20 12:50:33,653 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (not (= |c_node_create_#res#1.base| 0)) (= |c_#valid| (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse2 (select |c_#valid| .cse2)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse1 |c_node_create_#res#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from true [2022-11-20 12:50:33,663 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 0)) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from false [2022-11-20 12:50:33,667 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 0)) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from true [2022-11-20 12:50:33,678 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse0 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= .cse0 0) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))))) is different from false [2022-11-20 12:50:33,681 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse0 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= .cse0 0) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))))) is different from true [2022-11-20 12:50:33,697 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) (.cse0 (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not .cse0) (= .cse1 0) (or (and (<= 0 .cse1) (<= .cse1 0)) .cse0) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse2) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))))) is different from false [2022-11-20 12:50:33,701 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) (.cse0 (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not .cse0) (= .cse1 0) (or (and (<= 0 .cse1) (<= .cse1 0)) .cse0) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse2) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))))) is different from true [2022-11-20 12:50:33,710 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse2 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (and (<= 0 .cse1) (<= .cse1 0)) .cse2) (= .cse1 0) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not .cse2) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))))) is different from false [2022-11-20 12:50:33,714 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse2 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (and (<= 0 .cse1) (<= .cse1 0)) .cse2) (= .cse1 0) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not .cse2) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_30| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))))) is different from true [2022-11-20 12:50:33,724 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse2) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| 0)) (or .cse2 (and (<= .cse3 0) (<= 0 .cse3))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (= .cse3 0)))) is different from false [2022-11-20 12:50:33,727 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse2) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| 0)) (or .cse2 (and (<= .cse3 0) (<= 0 .cse3))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (= .cse3 0)))) is different from true [2022-11-20 12:50:33,739 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse1) 4)) (.cse4 (= .cse0 .cse1))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| .cse1 1)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 0) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (or (and (<= 0 .cse3) (<= .cse3 0)) .cse4) (= .cse3 0) (not .cse4) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse1) 1) (not (= .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= 0 .cse1)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse5 (select |v_#valid_BEFORE_CALL_29| .cse5))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))))) is different from false [2022-11-20 12:50:33,743 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse1) 4)) (.cse4 (= .cse0 .cse1))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_30| .cse1 1)) (= (select |v_#valid_BEFORE_CALL_30| .cse1) 0) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (or (and (<= 0 .cse3) (<= .cse3 0)) .cse4) (= .cse3 0) (not .cse4) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse1) 1) (not (= .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= 0 .cse1)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse5 (select |v_#valid_BEFORE_CALL_29| .cse5))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))))) is different from true [2022-11-20 12:50:33,759 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from false [2022-11-20 12:50:33,763 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_30| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0)))) is different from true [2022-11-20 12:50:33,775 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (not (= |c_node_create_~temp~0#1.base| 0)) (<= 0 |c_node_create_~temp~0#1.offset|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_29| .cse2))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from false [2022-11-20 12:50:33,779 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (not (= |c_node_create_~temp~0#1.base| 0)) (<= 0 |c_node_create_~temp~0#1.offset|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_29| .cse2))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from true [2022-11-20 12:50:33,887 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (and (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (exists ((v_ArrVal_2484 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2484))) (not (= |c_node_create_#res#1.base| 0)) (= |c_#valid| (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse2 (select |c_#valid| .cse2)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((v_ArrVal_2485 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2485) |c_#memory_$Pointer$.offset|)) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse1 |c_node_create_#res#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from false [2022-11-20 12:50:33,892 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (and (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (<= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (exists ((v_ArrVal_2484 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2484))) (not (= |c_node_create_#res#1.base| 0)) (= |c_#valid| (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse2 (select |c_#valid| .cse2)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_30| .cse3)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (exists ((v_ArrVal_2485 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2485) |c_#memory_$Pointer$.offset|)) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse1 |c_node_create_#res#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))))) is different from true [2022-11-20 12:50:33,949 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse0 (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse3 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse3) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_33| .cse5))) |v_#valid_BEFORE_CALL_33|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= 0 .cse6) (<= .cse6 0))) (= .cse4 .cse3) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (not (= .cse7 .cse2)) (not (= .cse7 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse7)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse8 (select |v_#valid_BEFORE_CALL_30| .cse8)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= 0 .cse3))))) is different from false [2022-11-20 12:50:33,954 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse0 (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse3 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse3) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_33| .cse5))) |v_#valid_BEFORE_CALL_33|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= 0 .cse6) (<= .cse6 0))) (= .cse4 .cse3) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (not (= .cse7 .cse2)) (not (= .cse7 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse7)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse8 (select |v_#valid_BEFORE_CALL_30| .cse8)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= 0 .cse3))))) is different from true [2022-11-20 12:50:34,018 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (not (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse3 .cse0)) (or (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) 4))) (and (<= 0 .cse4) (<= .cse4 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5) (= .cse6 .cse5)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse7 (select |v_#valid_BEFORE_CALL_29| .cse7))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_#valid_BEFORE_CALL_33| .cse8))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= 0 .cse5))))) is different from false [2022-11-20 12:50:34,024 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (not (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_30| .cse2)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse3 .cse0)) (or (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) 4))) (and (<= 0 .cse4) (<= .cse4 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5) (= .cse6 .cse5)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse7 (select |v_#valid_BEFORE_CALL_29| .cse7))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_#valid_BEFORE_CALL_33| .cse8))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= 0 .cse5))))) is different from true [2022-11-20 12:50:34,066 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse2 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse2) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) 4))) (and (<= 0 .cse4) (<= .cse4 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5) (= .cse6 .cse5)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse7 (select |v_#valid_BEFORE_CALL_29| .cse7))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_#valid_BEFORE_CALL_33| .cse8))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) (not (= 0 .cse5))))) is different from false [2022-11-20 12:50:34,071 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse2 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse2) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) 4))) (and (<= 0 .cse4) (<= .cse4 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5) (= .cse6 .cse5)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse7 (select |v_#valid_BEFORE_CALL_29| .cse7))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_#valid_BEFORE_CALL_33| .cse8))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) (not (= 0 .cse5))))) is different from true [2022-11-20 12:50:34,120 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse2)) (.cse11 (select |c_#memory_$Pointer$.offset| .cse2))) (let ((.cse7 (select .cse11 4)) (.cse4 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse5 4)) (.cse6 (+ .cse3 4))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (= .cse3 0) (not .cse4) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse5 .cse6) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= .cse7 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse7) (<= .cse7 0)) .cse4 (= .cse8 .cse2)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse2 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse8) (not (= 0 .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse11 .cse6)))))) is different from false [2022-11-20 12:50:34,126 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse2)) (.cse11 (select |c_#memory_$Pointer$.offset| .cse2))) (let ((.cse7 (select .cse11 4)) (.cse4 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse5 4)) (.cse6 (+ .cse3 4))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (= .cse3 0) (not .cse4) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse5 .cse6) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= .cse7 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse7) (<= .cse7 0)) .cse4 (= .cse8 .cse2)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse2 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse8) (not (= 0 .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse11 .cse6)))))) is different from true [2022-11-20 12:50:34,174 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse2)) (.cse11 (select |c_#memory_$Pointer$.offset| .cse2))) (let ((.cse7 (select .cse11 4)) (.cse4 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse5 4)) (.cse6 (+ .cse3 4))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (= .cse3 0) (not .cse4) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse5 .cse6) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= .cse7 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse7) (<= .cse7 0)) .cse4 (= .cse8 .cse2)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse2 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse8) (not (= 0 .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse11 .cse6)))))) is different from false [2022-11-20 12:50:34,180 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse2)) (.cse11 (select |c_#memory_$Pointer$.offset| .cse2))) (let ((.cse7 (select .cse11 4)) (.cse4 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse5 4)) (.cse6 (+ .cse3 4))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (= .cse3 0) (not .cse4) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse5 .cse6) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= .cse7 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse7) (<= .cse7 0)) .cse4 (= .cse8 .cse2)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse2 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse8) (not (= 0 .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse11 .cse6)))))) is different from true [2022-11-20 12:50:34,225 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse2)) (.cse11 (select |c_#memory_$Pointer$.offset| .cse2))) (let ((.cse7 (select .cse11 4)) (.cse4 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse5 4)) (.cse6 (+ .cse3 4))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (= .cse3 0) (not .cse4) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse5 .cse6) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= .cse7 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse7) (<= .cse7 0)) .cse4 (= .cse8 .cse2)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse2 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse8) (not (= 0 .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse11 .cse6)))))) is different from false [2022-11-20 12:50:34,230 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse2)) (.cse11 (select |c_#memory_$Pointer$.offset| .cse2))) (let ((.cse7 (select .cse11 4)) (.cse4 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse5 4)) (.cse6 (+ .cse3 4))) (and (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2)) (= .cse3 0) (not .cse4) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse5 .cse6) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= .cse7 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse7) (<= .cse7 0)) .cse4 (= .cse8 .cse2)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 0) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_33| .cse10))) |v_#valid_BEFORE_CALL_33|) (= (select (store |v_#valid_BEFORE_CALL_33| .cse2 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse8) (not (= 0 .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse11 .cse6)))))) is different from true [2022-11-20 12:50:34,274 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse7)) (.cse10 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select .cse4 (+ 4 (select .cse10 (+ .cse2 4)))))) (let ((.cse3 (select .cse10 4)) (.cse0 (+ 2 .cse6))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse3 0) (not (= (select .cse4 4) 0)) (or (and (<= 0 .cse3) (<= .cse3 0)) (= .cse5 .cse6) (= .cse7 .cse5)) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse5 1) .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_#valid_BEFORE_CALL_33| .cse8))) |v_#valid_BEFORE_CALL_33|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (not (= 0 .cse6)) (not (= 0 .cse5)))))))) is different from false [2022-11-20 12:50:34,279 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse7)) (.cse10 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select .cse4 (+ 4 (select .cse10 (+ .cse2 4)))))) (let ((.cse3 (select .cse10 4)) (.cse0 (+ 2 .cse6))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (v_arrayElimCell_201 Int) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimIndex_45 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (not (= v_arrayElimIndex_45 0)) (= |v_#valid_BEFORE_CALL_30| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_30| .cse1)))) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0))) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse3 0) (not (= (select .cse4 4) 0)) (or (and (<= 0 .cse3) (<= .cse3 0)) (= .cse5 .cse6) (= .cse7 .cse5)) (exists ((|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_28| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse5 1) .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_33| .cse5) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse8 (select |v_#valid_BEFORE_CALL_33| .cse8))) |v_#valid_BEFORE_CALL_33|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_29| .cse9))) |v_#valid_BEFORE_CALL_29|) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (not (= 0 .cse6)) (not (= 0 .cse5)))))))) is different from true [2022-11-20 12:50:34,328 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_201 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimIndex_45 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse9 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse6) (+ (select .cse9 (+ .cse4 4)) 4)))) (let ((.cse2 (select .cse9 4)) (.cse1 (+ 2 .cse8))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (<= 0 .cse2) (not (= .cse0 0)) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse4) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (not (= v_arrayElimIndex_45 0)) (= .cse4 0) (= |v_#valid_BEFORE_CALL_30| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7))) |v_#valid_BEFORE_CALL_33|) (not (= .cse8 0)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse0 1) .cse8) 0) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse10) 0) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse10)) 4) 0)))) is different from false [2022-11-20 12:50:34,333 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_201 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimIndex_45 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse9 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse6) (+ (select .cse9 (+ .cse4 4)) 4)))) (let ((.cse2 (select .cse9 4)) (.cse1 (+ 2 .cse8))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (<= 0 .cse2) (not (= .cse0 0)) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse4) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (not (= v_arrayElimIndex_45 0)) (= .cse4 0) (= |v_#valid_BEFORE_CALL_30| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse7 (select |v_#valid_BEFORE_CALL_33| .cse7))) |v_#valid_BEFORE_CALL_33|) (not (= .cse8 0)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse0 1) .cse8) 0) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse10) 0) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse10)) 4) 0)))) is different from true [2022-11-20 12:50:34,374 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_201 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimIndex_45 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) .cse7))) (let ((.cse4 (+ 2 .cse1))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse0 1) .cse1) 0) (not (= .cse0 0)) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (not (= .cse1 0)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (not (= v_arrayElimIndex_45 0)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_30| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 0) (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_33| .cse6))) |v_#valid_BEFORE_CALL_33|) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse7) 0)) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) is different from false [2022-11-20 12:50:34,378 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_201 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimIndex_45 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) .cse7))) (let ((.cse4 (+ 2 .cse1))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (= (select (store |v_#valid_BEFORE_CALL_33| .cse0 1) .cse1) 0) (not (= .cse0 0)) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_201) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (not (= .cse1 0)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_29|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3))) |v_#valid_BEFORE_CALL_29|) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_201) 1) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (not (= v_arrayElimIndex_45 0)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_30| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_30|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_30| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_28| .cse2) 0) (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_33| .cse6))) |v_#valid_BEFORE_CALL_33|) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_45) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_33| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse7) 0)) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) is different from true [2022-11-20 12:50:34,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:50:34,411 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-11-20 12:50:34,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 12:50:34,412 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-11-20 12:50:34,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:50:34,413 INFO L225 Difference]: With dead ends: 84 [2022-11-20 12:50:34,413 INFO L226 Difference]: Without dead ends: 81 [2022-11-20 12:50:34,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 49 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=206, Invalid=1612, Unknown=100, NotChecked=6272, Total=8190 [2022-11-20 12:50:34,417 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 487 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:50:34,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 191 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 199 Invalid, 0 Unknown, 487 Unchecked, 0.2s Time] [2022-11-20 12:50:34,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-20 12:50:34,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-11-20 12:50:34,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.1) internal successors, (77), 70 states have internal predecessors, (77), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 12:50:34,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2022-11-20 12:50:34,435 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 46 [2022-11-20 12:50:34,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:50:34,436 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2022-11-20 12:50:34,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 12:50:34,436 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2022-11-20 12:50:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 12:50:34,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:50:34,436 INFO L195 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] [2022-11-20 12:50:34,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 12:50:34,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 12:50:34,637 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:50:34,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:50:34,638 INFO L85 PathProgramCache]: Analyzing trace with hash -397767570, now seen corresponding path program 2 times [2022-11-20 12:50:34,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:50:34,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548651958] [2022-11-20 12:50:34,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:50:34,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:50:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:50:36,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:50:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:50:36,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:50:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:50:37,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 12:50:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:50:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:50:37,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:50:37,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548651958] [2022-11-20 12:50:37,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548651958] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:50:37,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027682624] [2022-11-20 12:50:37,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:50:37,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:50:37,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:50:37,365 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:50:37,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca3ed25a-925c-4e0b-a7d7-107fcc8a4039/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 12:50:37,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:50:37,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:50:37,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 161 conjunts are in the unsatisfiable core [2022-11-20 12:50:37,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:50:37,706 INFO L350 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 [2022-11-20 12:50:37,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 12:50:37,948 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.offset|)) is different from false [2022-11-20 12:50:37,950 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.offset|)) is different from true [2022-11-20 12:50:37,974 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) is different from false [2022-11-20 12:50:37,977 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) is different from true [2022-11-20 12:50:38,025 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2022-11-20 12:50:38,027 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from true [2022-11-20 12:50:38,070 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= |v_#valid_BEFORE_CALL_36| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0)))) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1)))) is different from false [2022-11-20 12:50:38,072 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= |v_#valid_BEFORE_CALL_36| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0)))) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1)))) is different from true [2022-11-20 12:50:38,101 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= |v_#valid_BEFORE_CALL_36| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0)))) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2022-11-20 12:50:38,103 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= |v_#valid_BEFORE_CALL_36| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0)))) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2022-11-20 12:50:38,150 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= |v_#valid_BEFORE_CALL_36| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0)))) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1)))) is different from false [2022-11-20 12:50:38,153 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= |v_#valid_BEFORE_CALL_36| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0)))) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1)))) is different from true [2022-11-20 12:50:38,237 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= |v_#valid_BEFORE_CALL_37| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_37| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_36| .cse1))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1)))) is different from false [2022-11-20 12:50:38,240 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= |v_#valid_BEFORE_CALL_37| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_37| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_36| .cse1))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1)))) is different from true [2022-11-20 12:50:38,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 12:50:38,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 12:50:38,318 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= .cse0 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_36| .cse3))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1)))))) is different from false [2022-11-20 12:50:38,322 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 .cse0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= .cse0 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_36| .cse3))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1)))))) is different from true [2022-11-20 12:50:38,349 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:50:38,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-11-20 12:50:38,364 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 12:50:38,364 INFO L350 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 31 treesize of output 41 [2022-11-20 12:50:38,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 12:50:38,424 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_37| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (and (<= 0 .cse2) (<= .cse2 0))) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse4 (select |v_#valid_BEFORE_CALL_36| .cse4))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1)))))) is different from false [2022-11-20 12:50:38,428 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_37| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (and (<= 0 .cse2) (<= .cse2 0))) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse4 (select |v_#valid_BEFORE_CALL_36| .cse4))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1)))))) is different from true [2022-11-20 12:50:38,511 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_37| .cse0) 1) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (<= 0 .cse2) (<= .cse2 0))) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_36| .cse3))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))))) is different from false [2022-11-20 12:50:38,515 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_37| .cse0) 1) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (<= 0 .cse2) (<= .cse2 0))) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_36| .cse3))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))))) is different from true [2022-11-20 12:50:38,644 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_37| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (or (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (<= .cse2 0) (<= 0 .cse2)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_36| .cse3))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0))) is different from false [2022-11-20 12:50:38,648 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_37| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (or (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (<= .cse2 0) (<= 0 .cse2)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_36| .cse3))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0))) is different from true [2022-11-20 12:50:38,737 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_append_~data#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| .cse1) 4))) (and (<= 0 .cse0) (<= .cse0 0))) (= .cse2 .cse1)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_36| .cse3))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse4 (select |v_#valid_BEFORE_CALL_37| .cse4)))) (= (select |v_#valid_BEFORE_CALL_37| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| .cse1 1)) (= (select |v_#valid_BEFORE_CALL_37| .cse2) 1)))))) is different from false [2022-11-20 12:50:38,741 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_append_~data#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| .cse1) 4))) (and (<= 0 .cse0) (<= .cse0 0))) (= .cse2 .cse1)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_36| .cse3))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse4 (select |v_#valid_BEFORE_CALL_37| .cse4)))) (= (select |v_#valid_BEFORE_CALL_37| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_37| .cse1 1)) (= (select |v_#valid_BEFORE_CALL_37| .cse2) 1)))))) is different from true [2022-11-20 12:50:38,786 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:50:38,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 38 [2022-11-20 12:50:38,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:38,795 INFO L350 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 27 treesize of output 15 [2022-11-20 12:50:38,831 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimCell_230) 1) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_60) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_230))))) is different from false [2022-11-20 12:50:38,836 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimCell_230) 1) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_60) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_230))))) is different from true [2022-11-20 12:50:38,903 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimCell_230) 1) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_60) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_230))))) is different from false [2022-11-20 12:50:38,907 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimCell_230) 1) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_60) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_230))))) is different from true [2022-11-20 12:50:38,994 INFO L350 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 [2022-11-20 12:50:39,045 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|) |c_node_create_#in~data#1|) (exists ((v_ArrVal_2747 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2747))) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimCell_230) 1) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_60) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_230)))) (exists ((v_ArrVal_2746 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2746)))) is different from false [2022-11-20 12:50:39,050 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) |c_node_create_#res#1.offset|) |c_node_create_#in~data#1|) (exists ((v_ArrVal_2747 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2747))) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_36| .cse0))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimCell_230) 1) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_60) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_230)))) (exists ((v_ArrVal_2746 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2746)))) is different from true [2022-11-20 12:50:39,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:39,194 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 12:50:39,194 INFO L350 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 93 treesize of output 79 [2022-11-20 12:50:39,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:39,235 INFO L321 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2022-11-20 12:50:39,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 60 [2022-11-20 12:50:39,292 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse4 (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_#valid_BEFORE_CALL_37| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_37| .cse2 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_37| .cse0) 1))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= 0 .cse3) (<= .cse3 0))) (= .cse0 .cse2) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse5 (select |v_#valid_BEFORE_CALL_36| .cse5))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0)))))) is different from false [2022-11-20 12:50:39,298 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse4 (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_37| .cse1)))) (= (select |v_#valid_BEFORE_CALL_37| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_37| .cse2 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_37| .cse0) 1))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= 0 .cse3) (<= .cse3 0))) (= .cse0 .cse2) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse5 (select |v_#valid_BEFORE_CALL_36| .cse5))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0)))))) is different from true [2022-11-20 12:50:39,513 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_36| .cse1))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse2 (select |v_#valid_BEFORE_CALL_40| .cse2)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 0) (= (select (store |v_#valid_BEFORE_CALL_37| .cse4 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse5 (select |v_#valid_BEFORE_CALL_37| .cse5)))) (= (select |v_#valid_BEFORE_CALL_37| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse3) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)) (or (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (and (<= 0 .cse6) (<= .cse6 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4) (= .cse3 .cse4))))) is different from false [2022-11-20 12:50:39,519 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_36| .cse1))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse2 (select |v_#valid_BEFORE_CALL_40| .cse2)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 0) (= (select (store |v_#valid_BEFORE_CALL_37| .cse4 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse5 (select |v_#valid_BEFORE_CALL_37| .cse5)))) (= (select |v_#valid_BEFORE_CALL_37| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse3) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)) (or (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (and (<= 0 .cse6) (<= .cse6 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4) (= .cse3 .cse4))))) is different from true [2022-11-20 12:50:39,700 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= .cse0 0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse2 (select |v_#valid_BEFORE_CALL_36| .cse2))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse3 (select |v_#valid_BEFORE_CALL_40| .cse3)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse0) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_37| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse6 (select |v_#valid_BEFORE_CALL_37| .cse6)))) (= (select |v_#valid_BEFORE_CALL_37| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse4) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)) (or (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse5) 4))) (and (<= 0 .cse7) (<= .cse7 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5) (= .cse4 .cse5)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5)))) is different from false [2022-11-20 12:50:39,705 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= .cse0 0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse2 (select |v_#valid_BEFORE_CALL_36| .cse2))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse3 (select |v_#valid_BEFORE_CALL_40| .cse3)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse0) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_37| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse6 (select |v_#valid_BEFORE_CALL_37| .cse6)))) (= (select |v_#valid_BEFORE_CALL_37| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse4) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)) (or (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse5) 4))) (and (<= 0 .cse7) (<= .cse7 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5) (= .cse4 .cse5)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5)))) is different from true [2022-11-20 12:50:40,032 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse6 (select .cse2 4)) (.cse10 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse3 (+ .cse0 4))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= .cse0 0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse2 .cse3) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse4 (select |v_#valid_BEFORE_CALL_36| .cse4))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse5 (select |v_#valid_BEFORE_CALL_40| .cse5)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|))) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse6) 0) (= (select (store |v_#valid_BEFORE_CALL_37| .cse7 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse8 (select |v_#valid_BEFORE_CALL_37| .cse8)))) (= (select |v_#valid_BEFORE_CALL_37| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse6) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)) (or (let ((.cse9 (select .cse10 4))) (and (<= 0 .cse9) (<= .cse9 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse7) (= .cse6 .cse7)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse10 .cse3)))))) is different from false [2022-11-20 12:50:40,038 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse6 (select .cse2 4)) (.cse10 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse3 (+ .cse0 4))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= .cse0 0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse2 .cse3) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse4 (select |v_#valid_BEFORE_CALL_36| .cse4))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse5 (select |v_#valid_BEFORE_CALL_40| .cse5)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|))) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse6) 0) (= (select (store |v_#valid_BEFORE_CALL_37| .cse7 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse8 (select |v_#valid_BEFORE_CALL_37| .cse8)))) (= (select |v_#valid_BEFORE_CALL_37| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse6) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)) (or (let ((.cse9 (select .cse10 4))) (and (<= 0 .cse9) (<= .cse9 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse7) (= .cse6 .cse7)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse10 .cse3)))))) is different from true [2022-11-20 12:50:40,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:40,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:50:40,488 INFO L321 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2022-11-20 12:50:40,488 INFO L350 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 255 treesize of output 146 [2022-11-20 12:50:40,610 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-20 12:50:40,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 583 treesize of output 380 [2022-11-20 12:50:40,719 INFO L321 Elim1Store]: treesize reduction 128, result has 14.7 percent of original size [2022-11-20 12:50:40,719 INFO L350 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 541 treesize of output 338 [2022-11-20 12:50:40,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:40,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:40,753 INFO L350 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 96 treesize of output 49 [2022-11-20 12:50:40,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:40,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:40,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:40,835 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-20 12:50:40,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 274 treesize of output 231 [2022-11-20 12:50:40,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2022-11-20 12:50:41,030 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse6 (+ .cse8 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse2) .cse6))) (let ((.cse1 (+ 2 .cse5))) (and (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)))) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0))) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_#valid_BEFORE_CALL_37| .cse3)))) (= (select |v_#valid_BEFORE_CALL_37| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_37| .cse4 1) .cse5) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse6) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse7 (select |v_#valid_BEFORE_CALL_36| .cse7))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (and (<= 0 .cse8) (<= .cse8 0)) (= .cse2 .cse4) (= .cse5 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 0)))))))) is different from false [2022-11-20 12:50:41,036 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse6 (+ .cse8 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse2) .cse6))) (let ((.cse1 (+ 2 .cse5))) (and (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)))) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0))) (exists ((|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_#valid_BEFORE_CALL_37| .cse3)))) (= (select |v_#valid_BEFORE_CALL_37| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_37| .cse4 1) .cse5) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse6) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse7 (select |v_#valid_BEFORE_CALL_36| .cse7))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (and (<= 0 .cse8) (<= .cse8 0)) (= .cse2 .cse4) (= .cse5 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 0)))))))) is different from true [2022-11-20 12:50:41,628 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (v_arrayElimCell_230 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimIndex_60 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse9 (+ .cse1 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse2) .cse9))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (+ 2 .cse8))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (<= 0 .cse1) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_#valid_BEFORE_CALL_37| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse4 (select |v_#valid_BEFORE_CALL_36| .cse4))) |v_#valid_BEFORE_CALL_36|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (<= .cse1 0) (= .cse5 0) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse7 (select |v_#valid_BEFORE_CALL_37| .cse7)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (store |v_#valid_BEFORE_CALL_37| .cse0 1) .cse8) 0) (<= .cse3 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_29| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse9) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))))))))) is different from false [2022-11-20 12:50:41,634 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (v_arrayElimCell_230 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimIndex_60 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse9 (+ .cse1 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse2) .cse9))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (+ 2 .cse8))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (<= 0 .cse1) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_#valid_BEFORE_CALL_37| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse4 (select |v_#valid_BEFORE_CALL_36| .cse4))) |v_#valid_BEFORE_CALL_36|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (<= .cse1 0) (= .cse5 0) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse7 (select |v_#valid_BEFORE_CALL_37| .cse7)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (store |v_#valid_BEFORE_CALL_37| .cse0 1) .cse8) 0) (<= .cse3 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_29| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse9) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))))))))) is different from true [2022-11-20 12:50:42,139 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (v_arrayElimCell_230 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimIndex_60 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$.offset| .cse10))) (let ((.cse0 (select .cse12 4)) (.cse1 (select |c_#memory_$Pointer$.base| .cse10))) (let ((.cse3 (select .cse1 4)) (.cse11 (+ .cse0 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse9 (select (select |c_#memory_$Pointer$.base| .cse3) .cse11))) (let ((.cse4 (+ 2 .cse9)) (.cse2 (+ .cse7 4))) (and (<= 0 .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse1 .cse2)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_#valid_BEFORE_CALL_37| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse5 (select |v_#valid_BEFORE_CALL_36| .cse5))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (<= .cse0 0) (= .cse7 0) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse8 (select |v_#valid_BEFORE_CALL_37| .cse8)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse9) 0)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (store |v_#valid_BEFORE_CALL_37| .cse10 1) .cse9) 0) (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_29| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse10) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse11) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= (select .cse12 .cse2) |c_ULTIMATE.start_main_~ptr~0#1.offset|))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2022-11-20 12:50:42,144 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (v_arrayElimCell_230 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimIndex_60 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$.offset| .cse10))) (let ((.cse0 (select .cse12 4)) (.cse1 (select |c_#memory_$Pointer$.base| .cse10))) (let ((.cse3 (select .cse1 4)) (.cse11 (+ .cse0 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse9 (select (select |c_#memory_$Pointer$.base| .cse3) .cse11))) (let ((.cse4 (+ 2 .cse9)) (.cse2 (+ .cse7 4))) (and (<= 0 .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse1 .cse2)) (= (select |v_old(#valid)_AFTER_CALL_29| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (select |v_#valid_BEFORE_CALL_37| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse5 (select |v_#valid_BEFORE_CALL_36| .cse5))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (<= .cse0 0) (= .cse7 0) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse8 (select |v_#valid_BEFORE_CALL_37| .cse8)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse9) 0)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (store |v_#valid_BEFORE_CALL_37| .cse10 1) .cse9) 0) (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_29| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| .cse10) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse11) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= (select .cse12 .cse2) |c_ULTIMATE.start_main_~ptr~0#1.offset|))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2022-11-20 12:50:42,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:50:42,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:42,434 INFO L321 Elim1Store]: treesize reduction 93, result has 7.0 percent of original size [2022-11-20 12:50:42,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 301 treesize of output 134 [2022-11-20 12:50:42,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:42,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:42,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:50:42,493 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-11-20 12:50:42,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 37 [2022-11-20 12:50:42,603 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)) (exists ((v_arrayElimIndex_75 Int) (v_arrayElimIndex_72 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimIndex_75) 0) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_75) 1) (= (select (store |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_72 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse2 (select |v_#valid_BEFORE_CALL_37| .cse2)))) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_29| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_72) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_36| .cse3))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))))) is different from false [2022-11-20 12:50:42,608 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_230 Int) (v_arrayElimIndex_60 Int) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_230) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_230) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_33| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_60) 0))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)) (exists ((v_arrayElimIndex_75 Int) (v_arrayElimIndex_72 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_37| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimIndex_75) 0) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_75) 1) (= (select (store |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_72 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_37| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_37|))) (store |v_old(#valid)_AFTER_CALL_29| .cse2 (select |v_#valid_BEFORE_CALL_37| .cse2)))) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_29| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_37| v_arrayElimIndex_72) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_36| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_36|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_36| .cse3))) |v_#valid_BEFORE_CALL_36|) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_36| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1))))) is different from true [2022-11-20 12:50:42,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 12:50:42,721 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 30 not checked. [2022-11-20 12:50:42,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:50:43,006 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2749 Int) (v_ArrVal_2757 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2750 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2751)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2750))) (let ((.cse5 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (+ (select (select .cse4 .cse5) .cse6) 4))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_2757))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8) v_ArrVal_2749))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3)))))))) is different from false [2022-11-20 12:50:43,041 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2749 Int) (v_ArrVal_2757 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2750 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse9)) (.cse8 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse9) 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2751)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2750))) (let ((.cse6 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ (select (select .cse5 .cse6) .cse7) 4))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_2757))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8) v_ArrVal_2749))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))))) is different from false [2022-11-20 12:50:43,075 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2749 Int) (v_ArrVal_2757 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2750 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse10 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse9) .cse10)) (.cse8 (+ (select (select |c_#memory_$Pointer$.offset| .cse9) .cse10) 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2751)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2750))) (let ((.cse6 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ 4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ (select (select .cse5 .cse6) .cse7) 4))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_2757))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8) v_ArrVal_2749))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))))) is different from false [2022-11-20 12:50:43,102 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2749 Int) (v_ArrVal_2757 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2750 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse10 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse9) .cse10)) (.cse8 (+ (select (select |c_#memory_$Pointer$.offset| .cse9) .cse10) 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse8 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2751)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse8 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2750))) (let ((.cse6 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ (select (select .cse5 .cse6) .cse7) 4))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_2757))) (store .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) (+ 8 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|) v_ArrVal_2749))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))))) is different from false [2022-11-20 12:50:43,234 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:50:43,235 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1383 treesize of output 1376 [2022-11-20 12:50:43,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:50:43,265 INFO L350 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 31892 treesize of output 29932 [2022-11-20 12:50:43,292 INFO L350 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 34508 treesize of output 29292 [2022-11-20 12:50:47,027 INFO L350 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 5972 treesize of output 4668 [2022-11-20 12:51:22,098 WARN L233 SmtUtils]: Spent 35.04s on a formula simplification that was a NOOP. DAG size: 317 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-20 12:51:22,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:51:22,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 14622 treesize of output 33624