./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 5e519f3a 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_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc --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-5e519f3 [2022-11-02 20:36:18,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:36:18,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:36:18,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:36:18,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:36:18,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:36:18,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:36:18,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:36:18,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:36:18,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:36:18,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:36:18,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:36:18,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:36:18,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:36:18,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:36:18,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:36:18,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:36:18,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:36:18,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:36:18,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:36:18,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:36:18,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:36:18,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:36:18,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:36:18,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:36:18,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:36:18,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:36:18,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:36:18,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:36:18,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:36:18,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:36:18,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:36:18,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:36:18,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:36:18,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:36:18,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:36:18,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:36:18,860 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:36:18,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:36:18,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:36:18,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:36:18,863 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:36:18,884 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:36:18,884 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:36:18,884 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:36:18,885 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:36:18,885 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:36:18,886 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:36:18,886 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:36:18,886 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:36:18,887 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:36:18,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:36:18,887 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:36:18,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:36:18,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:36:18,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:36:18,888 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:36:18,888 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:36:18,889 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:36:18,889 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:36:18,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:36:18,889 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:36:18,889 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:36:18,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:36:18,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:36:18,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:36:18,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:36:18,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:36:18,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:36:18,891 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:36:18,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:36:18,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:36:18,892 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:36:18,892 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:36:18,892 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:36:18,892 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_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/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_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc 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-02 20:36:19,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:36:19,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:36:19,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:36:19,231 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:36:19,232 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:36:19,233 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-11-02 20:36:19,300 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/data/277e199d2/8926f5b3c1b74c24a68f0a52138e6b5d/FLAG5ae304583 [2022-11-02 20:36:19,817 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:36:19,817 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2022-11-02 20:36:19,830 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/data/277e199d2/8926f5b3c1b74c24a68f0a52138e6b5d/FLAG5ae304583 [2022-11-02 20:36:20,123 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/data/277e199d2/8926f5b3c1b74c24a68f0a52138e6b5d [2022-11-02 20:36:20,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:36:20,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:36:20,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:36:20,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:36:20,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:36:20,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:36:20" (1/1) ... [2022-11-02 20:36:20,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e1c2999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:20, skipping insertion in model container [2022-11-02 20:36:20,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:36:20" (1/1) ... [2022-11-02 20:36:20,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:36:20,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:36:20,641 WARN L230 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_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2022-11-02 20:36:20,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:36:20,659 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:36:20,718 WARN L230 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_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2022-11-02 20:36:20,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:36:20,750 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:36:20,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:20 WrapperNode [2022-11-02 20:36:20,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:36:20,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:36:20,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:36:20,753 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:36:20,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:20" (1/1) ... [2022-11-02 20:36:20,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:20" (1/1) ... [2022-11-02 20:36:20,828 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 122 [2022-11-02 20:36:20,828 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:36:20,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:36:20,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:36:20,829 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:36:20,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:20" (1/1) ... [2022-11-02 20:36:20,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:20" (1/1) ... [2022-11-02 20:36:20,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:20" (1/1) ... [2022-11-02 20:36:20,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:20" (1/1) ... [2022-11-02 20:36:20,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:20" (1/1) ... [2022-11-02 20:36:20,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:20" (1/1) ... [2022-11-02 20:36:20,867 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:20" (1/1) ... [2022-11-02 20:36:20,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:20" (1/1) ... [2022-11-02 20:36:20,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:36:20,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:36:20,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:36:20,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:36:20,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:20" (1/1) ... [2022-11-02 20:36:20,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:36:20,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:20,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:36:20,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:36:20,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:36:20,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:36:20,971 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-02 20:36:20,971 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-02 20:36:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:36:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:36:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:36:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:36:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:36:20,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:36:20,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:36:20,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:36:20,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:36:20,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:36:21,155 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:36:21,157 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:36:21,413 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:36:21,418 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:36:21,419 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:36:21,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:36:21 BoogieIcfgContainer [2022-11-02 20:36:21,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:36:21,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:36:21,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:36:21,426 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:36:21,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:36:20" (1/3) ... [2022-11-02 20:36:21,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d3b328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:36:21, skipping insertion in model container [2022-11-02 20:36:21,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:36:20" (2/3) ... [2022-11-02 20:36:21,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d3b328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:36:21, skipping insertion in model container [2022-11-02 20:36:21,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:36:21" (3/3) ... [2022-11-02 20:36:21,429 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2022-11-02 20:36:21,447 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:36:21,447 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:36:21,511 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:36:21,519 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;@2c81b654, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:36:21,519 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:36:21,523 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-02 20:36:21,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:36:21,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:21,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:21,535 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:21,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:21,542 INFO L85 PathProgramCache]: Analyzing trace with hash 308507763, now seen corresponding path program 1 times [2022-11-02 20:36:21,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:21,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424299646] [2022-11-02 20:36:21,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:21,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:21,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-02 20:36:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:21,856 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-02 20:36:21,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:21,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424299646] [2022-11-02 20:36:21,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424299646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:21,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:21,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:36:21,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606475994] [2022-11-02 20:36:21,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:21,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:21,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:21,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:21,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:21,895 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-02 20:36:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:22,065 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2022-11-02 20:36:22,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:22,068 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-02 20:36:22,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:22,075 INFO L225 Difference]: With dead ends: 57 [2022-11-02 20:36:22,075 INFO L226 Difference]: Without dead ends: 26 [2022-11-02 20:36:22,080 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-02 20:36:22,086 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:22,087 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.1s Time] [2022-11-02 20:36:22,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-02 20:36:22,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-02 20:36:22,129 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-02 20:36:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-11-02 20:36:22,133 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2022-11-02 20:36:22,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:22,134 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-11-02 20:36:22,136 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-02 20:36:22,136 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-11-02 20:36:22,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:36:22,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:22,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:22,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:36:22,139 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:22,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:22,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2109805219, now seen corresponding path program 1 times [2022-11-02 20:36:22,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:22,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000819125] [2022-11-02 20:36:22,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:22,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:22,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-02 20:36:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:22,391 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-02 20:36:22,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:22,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000819125] [2022-11-02 20:36:22,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000819125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:22,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:22,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:36:22,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483265622] [2022-11-02 20:36:22,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:22,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:36:22,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:22,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:36:22,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:36:22,405 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-02 20:36:22,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:22,466 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-11-02 20:36:22,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:36:22,467 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-02 20:36:22,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:22,468 INFO L225 Difference]: With dead ends: 50 [2022-11-02 20:36:22,468 INFO L226 Difference]: Without dead ends: 31 [2022-11-02 20:36:22,469 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-02 20:36:22,470 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-02 20:36:22,471 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-02 20:36:22,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-02 20:36:22,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-11-02 20:36:22,477 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-02 20:36:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-11-02 20:36:22,479 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2022-11-02 20:36:22,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:22,479 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-11-02 20:36:22,479 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-02 20:36:22,480 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-11-02 20:36:22,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:36:22,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:22,481 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-02 20:36:22,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:36:22,482 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:22,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:22,482 INFO L85 PathProgramCache]: Analyzing trace with hash 493100305, now seen corresponding path program 1 times [2022-11-02 20:36:22,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:22,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439793246] [2022-11-02 20:36:22,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:22,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:22,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:22,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:36:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:22,725 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-02 20:36:22,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:22,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439793246] [2022-11-02 20:36:22,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439793246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:22,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:22,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:36:22,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397335181] [2022-11-02 20:36:22,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:22,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:36:22,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:22,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:36:22,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:36:22,738 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-02 20:36:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:22,814 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-11-02 20:36:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:36:22,815 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-02 20:36:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:22,816 INFO L225 Difference]: With dead ends: 55 [2022-11-02 20:36:22,816 INFO L226 Difference]: Without dead ends: 31 [2022-11-02 20:36:22,816 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-02 20:36:22,818 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.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:22,818 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.1s Time] [2022-11-02 20:36:22,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-02 20:36:22,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-11-02 20:36:22,828 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-02 20:36:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-11-02 20:36:22,829 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 27 [2022-11-02 20:36:22,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:22,829 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-11-02 20:36:22,830 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-02 20:36:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-11-02 20:36:22,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:36:22,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:22,831 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-02 20:36:22,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:36:22,831 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:22,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:22,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1095247597, now seen corresponding path program 1 times [2022-11-02 20:36:22,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:22,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009986454] [2022-11-02 20:36:22,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:22,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:23,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:23,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:36:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:23,079 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-02 20:36:23,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:23,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009986454] [2022-11-02 20:36:23,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009986454] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:23,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130697716] [2022-11-02 20:36:23,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:23,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:23,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:23,087 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:23,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:36:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:23,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:36:23,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:23,302 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-02 20:36:23,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:36:23,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-02 20:36:23,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130697716] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:36:23,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:36:23,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-11-02 20:36:23,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644159604] [2022-11-02 20:36:23,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:36:23,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:36:23,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:23,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:36:23,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:36:23,349 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-02 20:36:23,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:23,410 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2022-11-02 20:36:23,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:36:23,410 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-02 20:36:23,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:23,411 INFO L225 Difference]: With dead ends: 51 [2022-11-02 20:36:23,411 INFO L226 Difference]: Without dead ends: 32 [2022-11-02 20:36:23,412 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-02 20:36:23,413 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.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:23,413 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.0s Time] [2022-11-02 20:36:23,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-02 20:36:23,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-02 20:36:23,419 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-02 20:36:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-11-02 20:36:23,420 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 27 [2022-11-02 20:36:23,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:23,420 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-11-02 20:36:23,421 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-02 20:36:23,421 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-11-02 20:36:23,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:36:23,422 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:23,422 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-02 20:36:23,464 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:36:23,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:23,637 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:23,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:23,638 INFO L85 PathProgramCache]: Analyzing trace with hash -292922041, now seen corresponding path program 1 times [2022-11-02 20:36:23,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:23,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694236912] [2022-11-02 20:36:23,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:23,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:24,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:24,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:36:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:24,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:36:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:24,188 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-02 20:36:24,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:24,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694236912] [2022-11-02 20:36:24,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694236912] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:24,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:24,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:36:24,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577572179] [2022-11-02 20:36:24,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:24,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:36:24,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:24,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:36:24,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:36:24,194 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-02 20:36:24,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:24,353 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-11-02 20:36:24,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:36:24,354 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-02 20:36:24,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:24,355 INFO L225 Difference]: With dead ends: 45 [2022-11-02 20:36:24,355 INFO L226 Difference]: Without dead ends: 42 [2022-11-02 20:36:24,355 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-02 20:36:24,356 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 61 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:24,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 130 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:36:24,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-02 20:36:24,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-11-02 20:36:24,363 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-02 20:36:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-11-02 20:36:24,364 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 37 [2022-11-02 20:36:24,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:24,364 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-11-02 20:36:24,365 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-02 20:36:24,365 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-11-02 20:36:24,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:36:24,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:24,366 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-02 20:36:24,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:36:24,366 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:24,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:24,367 INFO L85 PathProgramCache]: Analyzing trace with hash -292920367, now seen corresponding path program 1 times [2022-11-02 20:36:24,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:24,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328283441] [2022-11-02 20:36:24,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:24,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:24,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:24,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:36:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:24,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:36:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:24,991 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-02 20:36:24,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:24,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328283441] [2022-11-02 20:36:24,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328283441] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:24,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946106129] [2022-11-02 20:36:24,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:24,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:24,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:24,994 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:25,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:36:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:25,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-02 20:36:25,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:25,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:25,589 WARN L855 $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-02 20:36:25,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:36:25,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:25,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:25,679 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-02 20:36:25,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:36:25,742 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_655 (Array Int Int)) (|v_node_create_~temp~0#1.base_13| Int)) (or (not (< |v_node_create_~temp~0#1.base_13| |c_#StackHeapBarrier|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_13| v_ArrVal_655) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0)))) is different from false [2022-11-02 20:36:25,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946106129] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:25,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:36:25,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-11-02 20:36:25,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021510406] [2022-11-02 20:36:25,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:36:25,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 20:36:25,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:25,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 20:36:25,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=525, Unknown=2, NotChecked=94, Total=702 [2022-11-02 20:36:25,747 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-02 20:36:26,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:26,202 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-11-02 20:36:26,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:36:26,203 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-02 20:36:26,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:26,204 INFO L225 Difference]: With dead ends: 39 [2022-11-02 20:36:26,204 INFO L226 Difference]: Without dead ends: 32 [2022-11-02 20:36:26,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=856, Unknown=2, NotChecked=122, Total=1122 [2022-11-02 20:36:26,205 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:26,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 214 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 261 Invalid, 0 Unknown, 30 Unchecked, 0.3s Time] [2022-11-02 20:36:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-02 20:36:26,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-02 20:36:26,212 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-02 20:36:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-11-02 20:36:26,213 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 37 [2022-11-02 20:36:26,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:26,213 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-11-02 20:36:26,214 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-02 20:36:26,214 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-11-02 20:36:26,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:36:26,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:26,215 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-02 20:36:26,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:36:26,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:26,438 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:26,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:26,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1499731437, now seen corresponding path program 1 times [2022-11-02 20:36:26,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:26,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491948265] [2022-11-02 20:36:26,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:26,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:27,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:27,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:36:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:27,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:36:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:27,404 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-02 20:36:27,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:27,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491948265] [2022-11-02 20:36:27,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491948265] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:27,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703611242] [2022-11-02 20:36:27,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:27,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:27,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:27,406 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:27,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:36:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:27,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-02 20:36:27,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:27,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:27,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:36:27,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:28,162 INFO L356 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-11-02 20:36:28,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:28,190 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 20:36:28,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:28,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:28,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:28,231 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-02 20:36:28,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:36:29,613 WARN L833 $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-02 20:36:29,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703611242] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:29,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:36:29,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2022-11-02 20:36:29,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116564009] [2022-11-02 20:36:29,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:36:29,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-02 20:36:29,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:29,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-02 20:36:29,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1076, Unknown=5, NotChecked=66, Total=1260 [2022-11-02 20:36:29,618 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-02 20:36:30,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:30,513 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-11-02 20:36:30,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:36:30,514 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-02 20:36:30,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:30,515 INFO L225 Difference]: With dead ends: 52 [2022-11-02 20:36:30,515 INFO L226 Difference]: Without dead ends: 49 [2022-11-02 20:36:30,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=246, Invalid=2105, Unknown=5, NotChecked=94, Total=2450 [2022-11-02 20:36:30,517 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 78 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:30,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 205 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 378 Invalid, 0 Unknown, 3 Unchecked, 0.3s Time] [2022-11-02 20:36:30,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-02 20:36:30,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2022-11-02 20:36:30,525 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-02 20:36:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-11-02 20:36:30,526 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 40 [2022-11-02 20:36:30,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:30,526 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-11-02 20:36:30,527 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-02 20:36:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-11-02 20:36:30,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:36:30,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:30,528 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-02 20:36:30,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:36:30,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-02 20:36:30,746 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:30,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:30,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1499729763, now seen corresponding path program 1 times [2022-11-02 20:36:30,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:30,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083950548] [2022-11-02 20:36:30,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:30,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:32,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:32,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:36:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:32,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:36:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:33,156 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-02 20:36:33,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:33,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083950548] [2022-11-02 20:36:33,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083950548] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:33,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31070696] [2022-11-02 20:36:33,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:33,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:33,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:33,158 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:33,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:36:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:33,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-02 20:36:33,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:33,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:36:34,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:36:34,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:36:34,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-02 20:36:34,398 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:36:34,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:36:34,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:36:34,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 20 [2022-11-02 20:36:34,650 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:36:34,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 43 [2022-11-02 20:36:35,025 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:35,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 22 [2022-11-02 20:36:35,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:35,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:36:35,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:35,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:36:35,375 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:36:35,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 49 [2022-11-02 20:36:35,401 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-02 20:36:35,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-02 20:36:35,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:35,605 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:35,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 15 [2022-11-02 20:36:35,667 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:35,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:36:35,865 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_19| Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1153 (Array Int Int))) (or (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_19| v_ArrVal_1153))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_19| v_ArrVal_1154) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) 0)) (not (< |v_node_create_~temp~0#1.base_19| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_19|) 0)))) is different from false [2022-11-02 20:36:35,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31070696] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:35,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:36:35,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 46 [2022-11-02 20:36:35,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572744611] [2022-11-02 20:36:35,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:36:35,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-02 20:36:35,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:35,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-02 20:36:35,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2122, Unknown=8, NotChecked=92, Total=2352 [2022-11-02 20:36:35,870 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 46 states, 44 states have (on average 1.5) internal successors, (66), 38 states have internal predecessors, (66), 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-02 20:36:38,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:38,440 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-11-02 20:36:38,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:36:38,440 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.5) internal successors, (66), 38 states have internal predecessors, (66), 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 40 [2022-11-02 20:36:38,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:38,442 INFO L225 Difference]: With dead ends: 61 [2022-11-02 20:36:38,442 INFO L226 Difference]: Without dead ends: 36 [2022-11-02 20:36:38,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=296, Invalid=3605, Unknown=9, NotChecked=122, Total=4032 [2022-11-02 20:36:38,445 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 52 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:38,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 383 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 657 Invalid, 0 Unknown, 49 Unchecked, 0.7s Time] [2022-11-02 20:36:38,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-02 20:36:38,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-11-02 20:36:38,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 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-02 20:36:38,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-11-02 20:36:38,455 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 40 [2022-11-02 20:36:38,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:38,455 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-11-02 20:36:38,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.5) internal successors, (66), 38 states have internal predecessors, (66), 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-02 20:36:38,455 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-11-02 20:36:38,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:36:38,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:38,457 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-02 20:36:38,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:36:38,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:38,670 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:38,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:38,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1422189688, now seen corresponding path program 1 times [2022-11-02 20:36:38,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:38,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413259633] [2022-11-02 20:36:38,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:38,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:40,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:40,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:36:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:41,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:36:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:41,455 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-02 20:36:41,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:41,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413259633] [2022-11-02 20:36:41,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413259633] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:41,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929472943] [2022-11-02 20:36:41,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:41,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:41,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:41,459 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:41,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:36:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:41,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 136 conjunts are in the unsatisfiable core [2022-11-02 20:36:41,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:41,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:42,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:42,219 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:36:42,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:36:42,510 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:36:42,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:36:42,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:36:42,752 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-02 20:36:42,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-11-02 20:36:42,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:36:42,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 20 [2022-11-02 20:36:42,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:36:43,055 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:36:43,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2022-11-02 20:36:43,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 22 [2022-11-02 20:36:43,608 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:43,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 33 [2022-11-02 20:36:43,622 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:36:43,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 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-02 20:36:43,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:43,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:43,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:36:43,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:43,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:36:43,949 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:36:43,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 64 [2022-11-02 20:36:43,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:36:43,975 INFO L356 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2022-11-02 20:36:43,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 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-02 20:36:43,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-02 20:36:44,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:36:44,957 INFO L356 Elim1Store]: treesize reduction 134, result has 17.8 percent of original size [2022-11-02 20:36:44,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 198 treesize of output 105 [2022-11-02 20:36:44,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:36:44,999 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:36:45,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 138 treesize of output 106 [2022-11-02 20:36:45,033 INFO L356 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2022-11-02 20:36:45,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 34 [2022-11-02 20:36:45,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-02 20:36:45,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:36:45,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-02 20:36:45,166 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:45,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 26 [2022-11-02 20:36:45,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:45,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:45,302 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-02 20:36:45,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:36:45,343 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 Int) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1410 Int) (v_ArrVal_1408 (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_1414) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1413) (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_1410)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1415) |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_1409)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-02 20:36:45,642 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 Int) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1410 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_11| Int) (v_ArrVal_1408 (Array Int Int))) (let ((.cse2 (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)))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_11| 4))) (or (not (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse2 v_ArrVal_1414) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1413) (select (select (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse0 .cse1 v_ArrVal_1410)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse1 v_ArrVal_1409)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-02 20:36:45,688 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 Int) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1410 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_11| Int) (v_ArrVal_1408 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (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 |c_#memory_$Pointer$.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_11| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1414) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1413) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 .cse2 v_ArrVal_1410)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse2 v_ArrVal_1409)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select .cse1 .cse2) 0)))))) is different from false [2022-11-02 20:36:45,966 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1415 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| Int) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1410 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_11| Int) (v_ArrVal_1408 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| v_ArrVal_1426)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| v_ArrVal_1425))) (let ((.cse2 (select (select .cse3 (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ 4 (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))))) (let ((.cse0 (select .cse3 .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_11| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18|) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| v_ArrVal_1424) .cse2 v_ArrVal_1414) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| v_ArrVal_1413) (select (select (store (store .cse3 .cse2 (store .cse0 .cse1 v_ArrVal_1410)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| v_ArrVal_1415) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse2 (store (select .cse4 .cse2) .cse1 v_ArrVal_1409)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_18| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-02 20:36:45,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929472943] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:45,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:36:45,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 54 [2022-11-02 20:36:45,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635276770] [2022-11-02 20:36:45,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:36:45,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-02 20:36:45,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:45,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-02 20:36:45,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2996, Unknown=7, NotChecked=452, Total=3660 [2022-11-02 20:36:45,974 INFO L87 Difference]: Start difference. First operand 35 states and 40 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-02 20:36:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:48,057 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-11-02 20:36:48,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 20:36:48,057 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-02 20:36:48,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:48,058 INFO L225 Difference]: With dead ends: 49 [2022-11-02 20:36:48,058 INFO L226 Difference]: Without dead ends: 47 [2022-11-02 20:36:48,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1267 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=388, Invalid=4591, Unknown=7, NotChecked=564, Total=5550 [2022-11-02 20:36:48,061 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 101 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:48,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 260 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 738 Invalid, 0 Unknown, 4 Unchecked, 0.8s Time] [2022-11-02 20:36:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-02 20:36:48,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-11-02 20:36:48,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 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-02 20:36:48,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-11-02 20:36:48,073 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 42 [2022-11-02 20:36:48,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:48,074 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-11-02 20:36:48,074 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-02 20:36:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-11-02 20:36:48,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:36:48,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:48,075 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, 1, 1] [2022-11-02 20:36:48,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:36:48,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:48,297 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:48,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:48,298 INFO L85 PathProgramCache]: Analyzing trace with hash 924723017, now seen corresponding path program 1 times [2022-11-02 20:36:48,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:48,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944470082] [2022-11-02 20:36:48,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:48,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:50,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:36:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:50,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:36:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:50,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:36:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:50,733 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:36:50,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:50,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944470082] [2022-11-02 20:36:50,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944470082] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:50,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433797638] [2022-11-02 20:36:50,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:50,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:36:50,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:36:50,735 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:36:50,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:36:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:50,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-02 20:36:50,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:36:51,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:51,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:51,200 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:36:51,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:51,425 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:36:51,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:51,597 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-02 20:36:51,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:51,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:51,830 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:36:51,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:52,308 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:36:52,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:52,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:52,334 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:36:52,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:52,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:36:52,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:52,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:36:52,666 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:36:52,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:52,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:36:52,704 INFO L356 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2022-11-02 20:36:52,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:53,254 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-02 20:36:53,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:53,306 INFO L356 Elim1Store]: treesize reduction 90, result has 14.3 percent of original size [2022-11-02 20:36:53,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:53,346 INFO L356 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-02 20:36:53,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:53,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:36:53,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:53,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:53,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:53,580 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:36:53,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:36:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:36:53,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:36:54,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433797638] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:36:54,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:36:54,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 49 [2022-11-02 20:36:54,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306619756] [2022-11-02 20:36:54,524 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:36:54,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-02 20:36:54,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:54,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-02 20:36:54,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2885, Unknown=12, NotChecked=0, Total=3080 [2022-11-02 20:36:54,527 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 49 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 40 states have internal predecessors, (70), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-02 20:36:57,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:36:57,506 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-11-02 20:36:57,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-02 20:36:57,507 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 40 states have internal predecessors, (70), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2022-11-02 20:36:57,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:36:57,510 INFO L225 Difference]: With dead ends: 49 [2022-11-02 20:36:57,510 INFO L226 Difference]: Without dead ends: 46 [2022-11-02 20:36:57,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=443, Invalid=5397, Unknown=12, NotChecked=0, Total=5852 [2022-11-02 20:36:57,513 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 55 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:36:57,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 397 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 649 Invalid, 0 Unknown, 31 Unchecked, 0.7s Time] [2022-11-02 20:36:57,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-02 20:36:57,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2022-11-02 20:36:57,525 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-02 20:36:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2022-11-02 20:36:57,526 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 44 [2022-11-02 20:36:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:36:57,526 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-11-02 20:36:57,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 40 states have internal predecessors, (70), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-02 20:36:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-11-02 20:36:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:36:57,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:36:57,528 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-02 20:36:57,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:36:57,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:36:57,754 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:36:57,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:57,755 INFO L85 PathProgramCache]: Analyzing trace with hash 924724691, now seen corresponding path program 1 times [2022-11-02 20:36:57,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:57,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716588139] [2022-11-02 20:36:57,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:57,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:00,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:37:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:01,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:37:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:01,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:37:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:01,853 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-02 20:37:01,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:01,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716588139] [2022-11-02 20:37:01,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716588139] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:01,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465861864] [2022-11-02 20:37:01,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:01,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:37:01,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:37:01,856 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:37:01,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:37:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:02,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 161 conjunts are in the unsatisfiable core [2022-11-02 20:37:02,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:37:02,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:02,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:02,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:02,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 14 [2022-11-02 20:37:02,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:02,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:03,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:03,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:03,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:03,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:03,415 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-02 20:37:03,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:03,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-02 20:37:03,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:37:03,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:37:03,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-02 20:37:03,775 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:37:03,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 99 treesize of output 90 [2022-11-02 20:37:03,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:03,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:03,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:37:04,447 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:37:04,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 92 treesize of output 43 [2022-11-02 20:37:04,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:04,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:04,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:37:04,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:04,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:04,797 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:37:04,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 100 treesize of output 80 [2022-11-02 20:37:04,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:04,821 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-02 20:37:04,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 25 treesize of output 38 [2022-11-02 20:37:04,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:04,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:04,855 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-02 20:37:04,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:04,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:37:06,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:06,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:37:06,069 INFO L356 Elim1Store]: treesize reduction 139, result has 14.7 percent of original size [2022-11-02 20:37:06,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 264 treesize of output 132 [2022-11-02 20:37:06,118 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-02 20:37:06,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 352 treesize of output 229 [2022-11-02 20:37:06,163 INFO L356 Elim1Store]: treesize reduction 120, result has 15.5 percent of original size [2022-11-02 20:37:06,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 new quantified variables, introduced 4 case distinctions, treesize of input 317 treesize of output 257 [2022-11-02 20:37:06,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:06,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:06,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:06,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-02 20:37:06,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:06,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:37:06,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:06,655 INFO L356 Elim1Store]: treesize reduction 43, result has 6.5 percent of original size [2022-11-02 20:37:06,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 184 treesize of output 77 [2022-11-02 20:37:06,671 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:37:06,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-11-02 20:37:06,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:06,819 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-02 20:37:06,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:37:07,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1951 Int) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (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| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1943)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1948)) (.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_1947))) (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_1951)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1944) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-02 20:37:07,420 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1951 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_16| Int) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (let ((.cse7 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_16| 4))) (or (not (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse1 v_ArrVal_1943)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1948)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse0 .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1947))) (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 (store |c_#memory_int| .cse2 (store (select |c_#memory_int| .cse2) .cse1 v_ArrVal_1951)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1944) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) (not (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7) |v_ULTIMATE.start_dll_append_~last~0#1.offset_16|))))))) is different from false [2022-11-02 20:37:07,465 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1951 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_16| Int) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse8 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse7) .cse8))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse0)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_16| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_ArrVal_1943)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1948)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse6 .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1947))) (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_1951)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1944) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))) (not (<= (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8) |v_ULTIMATE.start_dll_append_~last~0#1.offset_16|)) (not (= (select .cse6 .cse1) 0))))))) is different from false [2022-11-02 20:37:07,827 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| Int) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1951 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_16| Int) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1961)) (.cse11 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1963))) (let ((.cse1 (select (select .cse11 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse6 (select (select .cse11 .cse1) .cse2))) (let ((.cse3 (select .cse11 .cse6)) (.cse4 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_16| 4))) (or (not (<= (select (select .cse0 .cse1) .cse2) |v_ULTIMATE.start_dll_append_~last~0#1.offset_16|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24|) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| |c_#StackHeapBarrier|)) (not (= (select .cse3 .cse4) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (store (store .cse0 .cse6 (store (select .cse0 .cse6) .cse4 v_ArrVal_1943)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1948)) (.cse7 (store (store .cse11 .cse6 (store .cse3 .cse4 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1947))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (+ (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse5 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1962))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse4 v_ArrVal_1951))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1944) (select (select .cse7 .cse8) .cse9)) (select (select .cse10 .cse8) .cse9))))))))))) is different from false [2022-11-02 20:37:07,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465861864] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:07,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:37:07,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 31] total 56 [2022-11-02 20:37:07,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240263828] [2022-11-02 20:37:07,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:37:07,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-02 20:37:07,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:07,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-02 20:37:07,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3589, Unknown=6, NotChecked=492, Total=4290 [2022-11-02 20:37:07,833 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 56 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 46 states have internal predecessors, (74), 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-02 20:37:12,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:12,041 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-11-02 20:37:12,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:37:12,041 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 46 states have internal predecessors, (74), 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-02 20:37:12,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:12,042 INFO L225 Difference]: With dead ends: 48 [2022-11-02 20:37:12,042 INFO L226 Difference]: Without dead ends: 46 [2022-11-02 20:37:12,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1205 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=399, Invalid=5931, Unknown=6, NotChecked=636, Total=6972 [2022-11-02 20:37:12,045 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 46 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:12,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 348 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 943 Invalid, 0 Unknown, 70 Unchecked, 1.0s Time] [2022-11-02 20:37:12,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-02 20:37:12,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-11-02 20:37:12,059 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-02 20:37:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2022-11-02 20:37:12,059 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 44 [2022-11-02 20:37:12,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:12,060 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2022-11-02 20:37:12,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 46 states have internal predecessors, (74), 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-02 20:37:12,060 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2022-11-02 20:37:12,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:37:12,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:12,061 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-02 20:37:12,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:37:12,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-02 20:37:12,274 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:37:12,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:12,275 INFO L85 PathProgramCache]: Analyzing trace with hash 478170515, now seen corresponding path program 2 times [2022-11-02 20:37:12,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:12,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242371762] [2022-11-02 20:37:12,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:12,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:14,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:37:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:14,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:37:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:14,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:37:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:15,133 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-02 20:37:15,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:15,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242371762] [2022-11-02 20:37:15,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242371762] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:15,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323541477] [2022-11-02 20:37:15,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:37:15,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:37:15,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:37:15,134 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:37:15,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:37:15,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:37:15,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:37:15,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 167 conjunts are in the unsatisfiable core [2022-11-02 20:37:15,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:37:15,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:15,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:15,639 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:37:15,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:37:15,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:15,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:15,967 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:37:15,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:37:16,162 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:37:16,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 20 [2022-11-02 20:37:16,207 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-02 20:37:16,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-11-02 20:37:16,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:16,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-02 20:37:16,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:37:16,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:16,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:16,497 INFO L356 Elim1Store]: treesize reduction 55, result has 14.1 percent of original size [2022-11-02 20:37:16,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 59 [2022-11-02 20:37:16,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 22 [2022-11-02 20:37:16,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:37:17,117 INFO L356 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2022-11-02 20:37:17,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 120 treesize of output 56 [2022-11-02 20:37:17,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2022-11-02 20:37:17,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:37:17,141 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:37:17,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 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-02 20:37:17,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:17,500 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-02 20:37:17,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 126 treesize of output 116 [2022-11-02 20:37:17,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:17,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:37:17,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:17,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:17,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 98 [2022-11-02 20:37:17,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:17,551 INFO L356 Elim1Store]: treesize reduction 30, result has 47.4 percent of original size [2022-11-02 20:37:17,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 39 [2022-11-02 20:37:18,971 INFO L356 Elim1Store]: treesize reduction 242, result has 13.9 percent of original size [2022-11-02 20:37:18,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 14 case distinctions, treesize of input 372 treesize of output 153 [2022-11-02 20:37:19,032 INFO L356 Elim1Store]: treesize reduction 100, result has 20.0 percent of original size [2022-11-02 20:37:19,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 212 treesize of output 196 [2022-11-02 20:37:19,076 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-02 20:37:19,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 128 [2022-11-02 20:37:19,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:19,109 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-02 20:37:19,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 145 [2022-11-02 20:37:19,145 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:37:19,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 29 treesize of output 41 [2022-11-02 20:37:19,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-11-02 20:37:19,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 35 [2022-11-02 20:37:19,615 INFO L356 Elim1Store]: treesize reduction 78, result has 28.4 percent of original size [2022-11-02 20:37:19,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 new quantified variables, introduced 10 case distinctions, treesize of input 251 treesize of output 137 [2022-11-02 20:37:19,651 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:37:19,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 92 [2022-11-02 20:37:20,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:37:20,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:37:21,051 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_20| Int) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (let ((.cse2 (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)))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_20| 4))) (or (not (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse2 v_ArrVal_2223) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2232) (select (select (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse0 .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2226) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2229) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-02 20:37:21,077 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_20| Int) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (let ((.cse2 (let ((.cse3 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse3)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse3) 4))))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_20| 4))) (or (not (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse2 v_ArrVal_2223) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2232) (select (select (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse0 .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2226) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2229) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-02 20:37:21,111 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_20| Int) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (+ (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) 4))))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_20| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_2223) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2232) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2226) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2229) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= 0 (select .cse1 .cse2))))))) is different from false [2022-11-02 20:37:21,129 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_20| Int) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (+ (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) 4))))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_20| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_2223) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2232) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 .cse2 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2226) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse2 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2229) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= 0 (select .cse1 .cse2))))))) is different from false [2022-11-02 20:37:21,265 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| Int) (v_ArrVal_2229 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_20| Int) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2244 (Array Int Int)) (v_ArrVal_2243 (Array Int Int)) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2242 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| v_ArrVal_2244)) (.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| v_ArrVal_2242))) (let ((.cse0 (let ((.cse5 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (+ (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (select (select .cse1 (select (select .cse1 .cse5) .cse6)) (+ (select (select .cse4 .cse5) .cse6) 4))))) (let ((.cse2 (select .cse1 .cse0)) (.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_20| 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_27| v_ArrVal_2243) .cse0 v_ArrVal_2223) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| v_ArrVal_2232) (select (select (store (store .cse1 .cse0 (store .cse2 .cse3 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| v_ArrVal_2226) |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 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| v_ArrVal_2229) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_27|) 0)) (not (= (select .cse2 .cse3) 0))))))) is different from false [2022-11-02 20:37:21,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323541477] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:21,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:37:21,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 31] total 53 [2022-11-02 20:37:21,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804390367] [2022-11-02 20:37:21,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:37:21,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-02 20:37:21,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:21,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-02 20:37:21,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3212, Unknown=57, NotChecked=590, Total=4032 [2022-11-02 20:37:21,272 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 53 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 44 states have internal predecessors, (74), 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-02 20:37:25,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:25,295 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2022-11-02 20:37:25,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:37:25,295 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 44 states have internal predecessors, (74), 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-02 20:37:25,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:25,296 INFO L225 Difference]: With dead ends: 73 [2022-11-02 20:37:25,296 INFO L226 Difference]: Without dead ends: 61 [2022-11-02 20:37:25,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=311, Invalid=5341, Unknown=68, NotChecked=760, Total=6480 [2022-11-02 20:37:25,299 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:25,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 409 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 896 Invalid, 0 Unknown, 168 Unchecked, 1.1s Time] [2022-11-02 20:37:25,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-02 20:37:25,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-11-02 20:37:25,320 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-02 20:37:25,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-11-02 20:37:25,321 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 44 [2022-11-02 20:37:25,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:25,321 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-11-02 20:37:25,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 44 states have internal predecessors, (74), 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-02 20:37:25,322 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-11-02 20:37:25,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:37:25,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:25,323 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-02 20:37:25,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:37:25,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:37:25,534 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:37:25,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:25,535 INFO L85 PathProgramCache]: Analyzing trace with hash -397769244, now seen corresponding path program 2 times [2022-11-02 20:37:25,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:25,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446157584] [2022-11-02 20:37:25,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:25,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:27,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:37:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:27,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:37:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:27,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:37:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:28,053 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-02 20:37:28,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:28,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446157584] [2022-11-02 20:37:28,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446157584] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:28,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040703880] [2022-11-02 20:37:28,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:37:28,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:37:28,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:37:28,055 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:37:28,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:37:28,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:37:28,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:37:28,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 158 conjunts are in the unsatisfiable core [2022-11-02 20:37:28,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:37:28,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:28,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:28,635 WARN L833 $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-02 20:37:28,637 WARN L855 $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-02 20:37:28,665 WARN L833 $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-02 20:37:28,667 WARN L855 $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-02 20:37:28,720 WARN L833 $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-02 20:37:28,722 WARN L855 $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-02 20:37:28,775 WARN L833 $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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_31| .cse0)))) (< |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-02 20:37:28,777 WARN L855 $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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_31| .cse0)))) (< |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-02 20:37:28,817 WARN L833 $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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_31| .cse0)))) (< |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-02 20:37:28,820 WARN L855 $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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_31| .cse0)))) (< |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-02 20:37:28,878 WARN L833 $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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_31| .cse0)))) (< |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-02 20:37:28,880 WARN L855 $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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_31| .cse0)))) (< |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-02 20:37:28,979 WARN L833 $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)) (= |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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_31| .cse0)))) (< |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))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0)))) is different from false [2022-11-02 20:37:28,983 WARN L855 $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)) (= |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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_31| .cse0)))) (< |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))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0)))) is different from true [2022-11-02 20:37:29,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:29,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:29,081 WARN L833 $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|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_32| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_32| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)))) (<= .cse0 0) (not (= |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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3)))) (< |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-02 20:37:29,085 WARN L855 $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|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_32| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_32| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)))) (<= .cse0 0) (not (= |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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3)))) (< |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-02 20:37:29,160 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:37:29,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:29,193 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-02 20:37:29,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:29,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:29,222 WARN L833 $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) (exists ((|v_#valid_BEFORE_CALL_32| (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) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_32| .cse1)))) (= (select |v_#valid_BEFORE_CALL_32| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (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|)) (not (= |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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4)))) (< |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-02 20:37:29,226 WARN L855 $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) (exists ((|v_#valid_BEFORE_CALL_32| (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) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_32| .cse1)))) (= (select |v_#valid_BEFORE_CALL_32| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (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|)) (not (= |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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4)))) (< |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-02 20:37:29,306 WARN L833 $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_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_31| .cse2)))) (< |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))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_32| .cse1) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_32| .cse3)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0))))) is different from false [2022-11-02 20:37:29,310 WARN L855 $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_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_31| .cse2)))) (< |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))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_32| .cse1) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_32| .cse3)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0))))) is different from true [2022-11-02 20:37:29,458 WARN L833 $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) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| 0)) (or (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (<= .cse1 0) (<= 0 .cse1)))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_32| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse0) 1))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3)))) (< |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))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0))) is different from false [2022-11-02 20:37:29,462 WARN L855 $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) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| 0)) (or (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (<= .cse1 0) (<= 0 .cse1)))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_32| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse0) 1))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3)))) (< |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))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0))) is different from true [2022-11-02 20:37:29,566 WARN L833 $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_~#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|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3)))) (< |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))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_32| .cse4)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse1 1)) (= (select |v_#valid_BEFORE_CALL_32| .cse2) 1))) (not (= 0 .cse1))))) is different from false [2022-11-02 20:37:29,570 WARN L855 $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_~#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|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3)))) (< |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))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_32| .cse4)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse1 1)) (= (select |v_#valid_BEFORE_CALL_32| .cse2) 1))) (not (= 0 .cse1))))) is different from true [2022-11-02 20:37:29,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:37:29,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:29,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:29,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:29,663 WARN L833 $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_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_31| .cse0)))) (< |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))) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimCell_216 Int)) (and (< |c_#StackHeapBarrier| |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) (not (= v_arrayElimIndex_51 0)) (= |v_#valid_BEFORE_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_216) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimIndex_51) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_216) 1)))) is different from false [2022-11-02 20:37:29,667 WARN L855 $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_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_31| .cse0)))) (< |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))) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimCell_216 Int)) (and (< |c_#StackHeapBarrier| |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) (not (= v_arrayElimIndex_51 0)) (= |v_#valid_BEFORE_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_216) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimIndex_51) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_216) 1)))) is different from true [2022-11-02 20:37:29,749 WARN L833 $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_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_31| .cse0)))) (< |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))) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimCell_216 Int)) (and (< |c_#StackHeapBarrier| |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) (not (= v_arrayElimIndex_51 0)) (= |v_#valid_BEFORE_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_216) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimIndex_51) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_216) 1)))) is different from false [2022-11-02 20:37:29,753 WARN L855 $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_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_31| .cse0)))) (< |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))) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimCell_216 Int)) (and (< |c_#StackHeapBarrier| |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) (not (= v_arrayElimIndex_51 0)) (= |v_#valid_BEFORE_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_216) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimIndex_51) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_216) 1)))) is different from true [2022-11-02 20:37:29,897 WARN L833 $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) (not (= |c_node_create_#res#1.base| 0)) (exists ((v_ArrVal_2491 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2491))) (exists ((v_ArrVal_2490 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2490) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_31| .cse0)))) (< |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))) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimCell_216 Int)) (and (< |c_#StackHeapBarrier| |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) (not (= v_arrayElimIndex_51 0)) (= |v_#valid_BEFORE_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_216) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimIndex_51) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_216) 1)))) is different from false [2022-11-02 20:37:29,901 WARN L855 $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) (not (= |c_node_create_#res#1.base| 0)) (exists ((v_ArrVal_2491 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2491))) (exists ((v_ArrVal_2490 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2490) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_31| .cse0)))) (< |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))) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimCell_216 Int)) (and (< |c_#StackHeapBarrier| |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) (not (= v_arrayElimIndex_51 0)) (= |v_#valid_BEFORE_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_216) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimIndex_51) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_216) 1)))) is different from true [2022-11-02 20:37:30,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:30,048 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:37:30,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:30,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:30,072 INFO L356 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2022-11-02 20:37:30,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:30,215 WARN L833 $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 (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2)) (.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|) (= (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) (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|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_35| .cse1)))))) (or (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= 0 .cse2) (<= .cse2 0))) (= .cse4 .cse3) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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|) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse5 (select |v_#valid_BEFORE_CALL_31| .cse5)))) (= (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_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_32| .cse3 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse6 (select |v_#valid_BEFORE_CALL_32| .cse6)))) (= (select |v_#valid_BEFORE_CALL_32| .cse4) 1))) (not (= 0 .cse3))))) is different from false [2022-11-02 20:37:30,221 WARN L855 $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 (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2)) (.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|) (= (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) (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|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_35| .cse1)))))) (or (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= 0 .cse2) (<= .cse2 0))) (= .cse4 .cse3) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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|) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse5 (select |v_#valid_BEFORE_CALL_31| .cse5)))) (= (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_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_32| .cse3 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse6 (select |v_#valid_BEFORE_CALL_32| .cse6)))) (= (select |v_#valid_BEFORE_CALL_32| .cse4) 1))) (not (= 0 .cse3))))) is different from true [2022-11-02 20:37:30,433 WARN L833 $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 ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (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) (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) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_35| .cse1)))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_32| .cse4)))) (= (select |v_#valid_BEFORE_CALL_32| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse3 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (or (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= 0 .cse5) (<= .cse5 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3) (= .cse2 .cse3)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6)))) (<= .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 .cse3))))) is different from false [2022-11-02 20:37:30,438 WARN L855 $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 ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (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) (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) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse1 (select |v_#valid_BEFORE_CALL_35| .cse1)))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_32| .cse4)))) (= (select |v_#valid_BEFORE_CALL_32| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse3 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (or (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= 0 .cse5) (<= .cse5 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3) (= .cse2 .cse3)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6)))) (<= .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 .cse3))))) is different from true [2022-11-02 20:37:30,649 WARN L833 $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 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse0 0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_35| .cse2)))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse0) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_32| .cse5)))) (= (select |v_#valid_BEFORE_CALL_32| .cse3) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse4 1) |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)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7)))) (<= .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))) (not (= 0 .cse4))))) is different from false [2022-11-02 20:37:30,654 WARN L855 $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 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse0 0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_35| .cse2)))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse0) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_32| .cse5)))) (= (select |v_#valid_BEFORE_CALL_32| .cse3) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse4 1) |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)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7)))) (<= .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))) (not (= 0 .cse4))))) is different from true [2022-11-02 20:37:31,000 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (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| .cse6))) (let ((.cse5 (select .cse2 4)) (.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse9 (select |c_#memory_$Pointer$.offset| .cse6)) (.cse3 (+ .cse0 4))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 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_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_35| .cse4)))))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse7 (select |v_#valid_BEFORE_CALL_32| .cse7)))) (= (select |v_#valid_BEFORE_CALL_32| .cse5) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse6 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (or (let ((.cse8 (select .cse9 4))) (and (<= 0 .cse8) (<= .cse8 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6) (= .cse5 .cse6)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse10 (select |v_#valid_BEFORE_CALL_31| .cse10)))) (<= .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))) (not (= 0 .cse6)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse9 .cse3)))))) is different from false [2022-11-02 20:37:31,004 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (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| .cse6))) (let ((.cse5 (select .cse2 4)) (.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse9 (select |c_#memory_$Pointer$.offset| .cse6)) (.cse3 (+ .cse0 4))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 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_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_35| .cse4)))))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse7 (select |v_#valid_BEFORE_CALL_32| .cse7)))) (= (select |v_#valid_BEFORE_CALL_32| .cse5) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse6 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (or (let ((.cse8 (select .cse9 4))) (and (<= 0 .cse8) (<= .cse8 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6) (= .cse5 .cse6)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse10 (select |v_#valid_BEFORE_CALL_31| .cse10)))) (<= .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))) (not (= 0 .cse6)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse9 .cse3)))))) is different from true [2022-11-02 20:37:31,181 WARN L833 $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 ((.cse1 (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 ((.cse6 (select .cse3 4)) (.cse2 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse10 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse4 (+ .cse1 4)) (.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse1 0) (<= .cse2 |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|) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse2 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_35| .cse5)))))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse8 (select |v_#valid_BEFORE_CALL_32| .cse8)))) (= (select |v_#valid_BEFORE_CALL_32| .cse6) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse7 1) |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)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse11 (select |v_#valid_BEFORE_CALL_31| .cse11)))) (<= .cse2 |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 .cse7)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse10 .cse4)) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)))))) is different from false [2022-11-02 20:37:31,186 WARN L855 $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 ((.cse1 (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 ((.cse6 (select .cse3 4)) (.cse2 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse10 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse4 (+ .cse1 4)) (.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= .cse1 0) (<= .cse2 |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|) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse2 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse5 (select |v_#valid_BEFORE_CALL_35| .cse5)))))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse8 (select |v_#valid_BEFORE_CALL_32| .cse8)))) (= (select |v_#valid_BEFORE_CALL_32| .cse6) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse7 1) |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)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse11 (select |v_#valid_BEFORE_CALL_31| .cse11)))) (<= .cse2 |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 .cse7)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse10 .cse4)) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)))))) is different from true [2022-11-02 20:37:31,366 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (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| .cse6))) (let ((.cse5 (select .cse2 4)) (.cse10 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse9 (select |c_#memory_$Pointer$.offset| .cse6)) (.cse3 (+ .cse0 4))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 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_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_35| .cse4)))))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse7 (select |v_#valid_BEFORE_CALL_32| .cse7)))) (= (select |v_#valid_BEFORE_CALL_32| .cse5) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse6 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (or (let ((.cse8 (select .cse9 4))) (and (<= 0 .cse8) (<= .cse8 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6) (= .cse5 .cse6)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse10) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse10) 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse11 (select |v_#valid_BEFORE_CALL_31| .cse11)))) (<= .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))) (not (= 0 .cse6)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse9 .cse3)))))) is different from false [2022-11-02 20:37:31,371 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (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| .cse6))) (let ((.cse5 (select .cse2 4)) (.cse10 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse9 (select |c_#memory_$Pointer$.offset| .cse6)) (.cse3 (+ .cse0 4))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 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_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_35| .cse4)))))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse7 (select |v_#valid_BEFORE_CALL_32| .cse7)))) (= (select |v_#valid_BEFORE_CALL_32| .cse5) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse6 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (or (let ((.cse8 (select .cse9 4))) (and (<= 0 .cse8) (<= .cse8 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6) (= .cse5 .cse6)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse10) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse10) 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse11 (select |v_#valid_BEFORE_CALL_31| .cse11)))) (<= .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))) (not (= 0 .cse6)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse9 .cse3)))))) is different from true [2022-11-02 20:37:31,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:31,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:31,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:37:31,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:31,648 INFO L356 Elim1Store]: treesize reduction 163, result has 16.0 percent of original size [2022-11-02 20:37:31,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 363 treesize of output 156 [2022-11-02 20:37:31,763 INFO L356 Elim1Store]: treesize reduction 172, result has 11.3 percent of original size [2022-11-02 20:37:31,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 517 treesize of output 302 [2022-11-02 20:37:31,859 INFO L356 Elim1Store]: treesize reduction 86, result has 18.9 percent of original size [2022-11-02 20:37:31,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 411 treesize of output 339 [2022-11-02 20:37:32,065 WARN L833 $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$.offset| .cse5) 4)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse5) (+ .cse2 4))) (.cse8 (+ .cse7 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse8))) (let ((.cse3 (+ .cse0 2))) (and (not (= .cse0 0)) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 8)) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (<= .cse3 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_35| .cse4)))))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_32| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= |v_#valid_BEFORE_CALL_32| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse6 (select |v_#valid_BEFORE_CALL_32| .cse6)))) (= (select (store |v_#valid_BEFORE_CALL_32| .cse5 1) .cse0) 0))) (or (and (<= 0 .cse7) (<= .cse7 0)) (= .cse1 .cse5) (= .cse0 .cse5)) (= 0 (select (select |c_#memory_$Pointer$.offset| .cse1) .cse8)) (not (= 0 .cse5)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_31| .cse9)))) (<= .cse3 |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-02 20:37:32,071 WARN L855 $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$.offset| .cse5) 4)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse5) (+ .cse2 4))) (.cse8 (+ .cse7 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse8))) (let ((.cse3 (+ .cse0 2))) (and (not (= .cse0 0)) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 8)) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (<= .cse3 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_35| .cse4)))))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_32| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= |v_#valid_BEFORE_CALL_32| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse6 (select |v_#valid_BEFORE_CALL_32| .cse6)))) (= (select (store |v_#valid_BEFORE_CALL_32| .cse5 1) .cse0) 0))) (or (and (<= 0 .cse7) (<= .cse7 0)) (= .cse1 .cse5) (= .cse0 .cse5)) (= 0 (select (select |c_#memory_$Pointer$.offset| .cse1) .cse8)) (not (= 0 .cse5)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_31| .cse9)))) (<= .cse3 |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-02 20:37:32,870 WARN L833 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (v_arrayElimCell_216 Int) (v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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_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 ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) 4)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse0) (+ .cse5 4))) (.cse4 (+ .cse1 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4))) (let ((.cse2 (+ 2 .cse7))) (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) (<= 0 .cse1) (not (= .cse0 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= |v_#valid_BEFORE_CALL_31| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse1 0) (not (= v_arrayElimIndex_51 0)) (not (= .cse7 0)) (= (select |v_#valid_BEFORE_CALL_32| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= .cse5 0) (= .cse3 (select (select |c_#memory_$Pointer$.base| .cse7) 8)) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (<= .cse2 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_32| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse8 (select |v_#valid_BEFORE_CALL_32| .cse8)))) (= (select |v_#valid_BEFORE_CALL_32| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= (select (store |v_#valid_BEFORE_CALL_32| .cse0 1) .cse7) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse9 (select |v_#valid_BEFORE_CALL_35| .cse9)))) (= 0 (select |v_old(#valid)_AFTER_CALL_26| .cse3))))))))) is different from false [2022-11-02 20:37:34,966 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (v_arrayElimCell_216 Int) (v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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_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 ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) 4)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse0) (+ .cse5 4))) (.cse4 (+ .cse1 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4))) (let ((.cse2 (+ 2 .cse7))) (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) (<= 0 .cse1) (not (= .cse0 0)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (= |v_#valid_BEFORE_CALL_31| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse1 0) (not (= v_arrayElimIndex_51 0)) (not (= .cse7 0)) (= (select |v_#valid_BEFORE_CALL_32| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= .cse5 0) (= .cse3 (select (select |c_#memory_$Pointer$.base| .cse7) 8)) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (<= .cse2 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_32| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse8 (select |v_#valid_BEFORE_CALL_32| .cse8)))) (= (select |v_#valid_BEFORE_CALL_32| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= (select (store |v_#valid_BEFORE_CALL_32| .cse0 1) .cse7) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse9 (select |v_#valid_BEFORE_CALL_35| .cse9)))) (= 0 (select |v_old(#valid)_AFTER_CALL_26| .cse3))))))))) is different from true [2022-11-02 20:37:35,305 INFO L356 Elim1Store]: treesize reduction 66, result has 4.3 percent of original size [2022-11-02 20:37:35,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 353 treesize of output 229 [2022-11-02 20:37:35,587 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (v_arrayElimCell_216 Int) (v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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_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 ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (let ((.cse4 (+ 2 .cse2))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (not (= .cse2 0)) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_32| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (= |v_#valid_BEFORE_CALL_31| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3)))) (= (select (select |c_#memory_$Pointer$.base| .cse2) 8) .cse1) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_32| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse0 1) .cse2) 0) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_32| .cse5)))) (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_old(#valid)_AFTER_CALL_26| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= |v_#valid_BEFORE_CALL_35| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_35| .cse6)))))))))) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) is different from false [2022-11-02 20:37:35,592 WARN L855 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (v_arrayElimCell_216 Int) (v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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_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 ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (let ((.cse4 (+ 2 .cse2))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (not (= .cse2 0)) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_32| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (= |v_#valid_BEFORE_CALL_31| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3)))) (= (select (select |c_#memory_$Pointer$.base| .cse2) 8) .cse1) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_32| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse0 1) .cse2) 0) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_32| .cse5)))) (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_old(#valid)_AFTER_CALL_26| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= |v_#valid_BEFORE_CALL_35| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_35| .cse6)))))))))) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) is different from true [2022-11-02 20:37:35,862 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:37:35,867 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:37:35,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 62 [2022-11-02 20:37:35,981 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (exists ((v_arrayElimIndex_64 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimIndex_66 Int)) (and (= (select (store |v_#valid_BEFORE_CALL_32| v_arrayElimIndex_64 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimIndex_64) 0) (not (= v_arrayElimIndex_64 0)) (= |v_#valid_BEFORE_CALL_32| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_32| .cse0)))) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimIndex_66) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_66)))) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_35| .cse2)))))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3)))) (<= .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))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)))) is different from false [2022-11-02 20:37:35,985 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (exists ((v_arrayElimIndex_64 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimIndex_66 Int)) (and (= (select (store |v_#valid_BEFORE_CALL_32| v_arrayElimIndex_64 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimIndex_64) 0) (not (= v_arrayElimIndex_64 0)) (= |v_#valid_BEFORE_CALL_32| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse0 (select |v_#valid_BEFORE_CALL_32| .cse0)))) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimIndex_66) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimIndex_66)))) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_35| .cse2)))))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3)))) (<= .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))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)))) is different from true [2022-11-02 20:37:35,987 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-02 20:37:35,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:37:37,109 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2502 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| Int) (v_ArrVal_2508 (Array Int Int)) (v_ArrVal_2507 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| v_ArrVal_2508)) (.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| v_ArrVal_2507))) (let ((.cse11 (select (select .cse8 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse12 (+ (select (select .cse9 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse7 (select (select .cse8 .cse11) .cse12))) (let ((.cse0 (select .cse8 .cse7)) (.cse10 (select .cse9 .cse7)) (.cse1 (+ (select (select .cse9 .cse11) .cse12) 4))) (or (not (= 0 (select .cse0 .cse1))) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| 0) (not (= (let ((.cse5 (store (store .cse9 .cse7 (store .cse10 .cse1 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| v_ArrVal_2502)) (.cse2 (let ((.cse6 (store .cse8 .cse7 (store .cse0 .cse1 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30|)))) (store .cse6 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| (store (select .cse6 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30|) 8 .cse7))))) (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 .cse2 (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 4)))) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30|) 0)) (not (= (select .cse10 .cse1) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| |c_#StackHeapBarrier|)))))))) is different from false [2022-11-02 20:37:37,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040703880] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:37,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:37:37,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 31] total 54 [2022-11-02 20:37:37,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848353808] [2022-11-02 20:37:37,126 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:37:37,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-02 20:37:37,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:37,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-02 20:37:37,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1318, Unknown=52, NotChecked=2522, Total=4032 [2022-11-02 20:37:37,128 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-02 20:37:37,551 WARN L833 $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-02 20:37:37,553 WARN L855 $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-02 20:37:37,557 WARN L833 $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-02 20:37:37,560 WARN L855 $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-02 20:37:37,563 WARN L833 $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-02 20:37:37,572 WARN L855 $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-02 20:37:37,578 WARN L833 $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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_31| .cse0)))) (< |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-02 20:37:37,581 WARN L855 $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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_31| .cse0)))) (< |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-02 20:37:37,585 WARN L833 $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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_31| .cse1)))) (< |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-02 20:37:37,588 WARN L855 $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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_31| .cse1)))) (< |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-02 20:37:37,605 WARN L833 $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|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3)))) (< |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))) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse1 |c_node_create_#res#1.base|)))) is different from false [2022-11-02 20:37:37,611 WARN L855 $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|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3)))) (< |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))) (<= 0 |c_node_create_#res#1.offset|) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= .cse1 |c_node_create_#res#1.base|)))) is different from true [2022-11-02 20:37:37,628 WARN L833 $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|)) (= |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|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_31| .cse0)))) (< |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))) (<= (+ |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_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0)))) is different from false [2022-11-02 20:37:37,632 WARN L855 $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|)) (= |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|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_31| .cse0)))) (< |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))) (<= (+ |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_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0)))) is different from true [2022-11-02 20:37:37,655 WARN L833 $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) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_32| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_32| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| |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_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_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3)))) (< |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))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1)))) is different from false [2022-11-02 20:37:37,659 WARN L855 $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) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_32| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_32| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| |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_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_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3)))) (< |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))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1)))) is different from true [2022-11-02 20:37:37,671 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |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|) .cse5))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) (.cse2 (= .cse0 |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) (exists ((|v_#valid_BEFORE_CALL_32| (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) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_32| .cse1)))) (= (select |v_#valid_BEFORE_CALL_32| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~new_head~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) (not .cse2) (= .cse3 0) (or (and (<= 0 .cse3) (<= .cse3 0)) .cse2) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4)))) (< |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))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1))))) is different from false [2022-11-02 20:37:37,674 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |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|) .cse5))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) (.cse2 (= .cse0 |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) (exists ((|v_#valid_BEFORE_CALL_32| (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) (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_32| .cse1)))) (= (select |v_#valid_BEFORE_CALL_32| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~new_head~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) (not .cse2) (= .cse3 0) (or (and (<= 0 .cse3) (<= .cse3 0)) .cse2) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4)))) (< |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))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1))))) is different from true [2022-11-02 20:37:37,687 WARN L833 $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_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3)))) (< |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))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_32| .cse0) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_32| .cse4)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2022-11-02 20:37:37,691 WARN L855 $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_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3)))) (< |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))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_32| .cse0) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_32| .cse4)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2022-11-02 20:37:37,706 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse2 (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|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse0) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| 0)) (or .cse0 (and (<= .cse2 0) (<= 0 .cse2))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_32| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse1) 1))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4)))) (< |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))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1) (= .cse2 0)))) is different from false [2022-11-02 20:37:37,710 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse2 (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|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse0) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| 0)) (or .cse0 (and (<= .cse2 0) (<= 0 .cse2))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse3 (select |v_#valid_BEFORE_CALL_32| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse1) 1))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4)))) (< |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))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1) (= .cse2 0)))) is different from true [2022-11-02 20:37:37,725 WARN L833 $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 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse3) 4)) (.cse2 (= .cse0 .cse3))) (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_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (or (and (<= 0 .cse1) (<= .cse1 0)) .cse2) (= .cse1 0) (not .cse2) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse3) 1) (not (= .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4)))) (< |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))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_32| .cse5)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse3 1)) (= (select |v_#valid_BEFORE_CALL_32| .cse0) 1))) (not (= 0 .cse3)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-02 20:37:37,729 WARN L855 $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 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse3) 4)) (.cse2 (= .cse0 .cse3))) (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_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (or (and (<= 0 .cse1) (<= .cse1 0)) .cse2) (= .cse1 0) (not .cse2) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse3) 1) (not (= .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4)))) (< |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))) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_32| .cse5)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| .cse3 1)) (= (select |v_#valid_BEFORE_CALL_32| .cse0) 1))) (not (= 0 .cse3)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-02 20:37:37,747 WARN L833 $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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_31| .cse0)))) (< |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))) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimCell_216 Int)) (and (< |c_#StackHeapBarrier| |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) (not (= v_arrayElimIndex_51 0)) (= |v_#valid_BEFORE_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_216) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimIndex_51) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_216) 1)))) is different from false [2022-11-02 20:37:37,751 WARN L855 $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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_31| .cse0)))) (< |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))) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimCell_216 Int)) (and (< |c_#StackHeapBarrier| |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) (not (= v_arrayElimIndex_51 0)) (= |v_#valid_BEFORE_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse1 (select |v_#valid_BEFORE_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_216) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimIndex_51) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_216) 1)))) is different from true [2022-11-02 20:37:37,763 WARN L833 $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)) (= |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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_31| .cse1)))) (< |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))) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimCell_216 Int)) (and (< |c_#StackHeapBarrier| |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) (not (= v_arrayElimIndex_51 0)) (= |v_#valid_BEFORE_CALL_32| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_32| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_216) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimIndex_51) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_216) 1))))) is different from false [2022-11-02 20:37:37,767 WARN L855 $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)) (= |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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_31| .cse1)))) (< |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))) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimCell_216 Int)) (and (< |c_#StackHeapBarrier| |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) (not (= v_arrayElimIndex_51 0)) (= |v_#valid_BEFORE_CALL_32| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse2 (select |v_#valid_BEFORE_CALL_32| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_216) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimIndex_51) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_216) 1))))) is different from true [2022-11-02 20:37:37,826 WARN L833 $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.offset| 0) (< |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))) (not (= |c_node_create_#res#1.base| 0)) (exists ((v_ArrVal_2491 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2491))) (exists ((v_ArrVal_2490 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2490) |c_#memory_$Pointer$.base|)) (= |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_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3)))) (< |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))) (<= 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_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimCell_216 Int)) (and (< |c_#StackHeapBarrier| |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) (not (= v_arrayElimIndex_51 0)) (= |v_#valid_BEFORE_CALL_32| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_32| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_216) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimIndex_51) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_216) 1))))) is different from false [2022-11-02 20:37:37,832 WARN L855 $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.offset| 0) (< |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))) (not (= |c_node_create_#res#1.base| 0)) (exists ((v_ArrVal_2491 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2491))) (exists ((v_ArrVal_2490 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2490) |c_#memory_$Pointer$.base|)) (= |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_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3)))) (< |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))) (<= 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_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (v_arrayElimCell_216 Int)) (and (< |c_#StackHeapBarrier| |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) (not (= v_arrayElimIndex_51 0)) (= |v_#valid_BEFORE_CALL_32| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse4 (select |v_#valid_BEFORE_CALL_32| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_26| v_arrayElimCell_216) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimIndex_51) 0) (= (select |v_#valid_BEFORE_CALL_32| v_arrayElimCell_216) 1))))) is different from true [2022-11-02 20:37:37,890 WARN L833 $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|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (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|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 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) (= |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|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_35| .cse2)))))) (or (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (and (<= 0 .cse3) (<= .cse3 0))) (= .cse5 .cse4) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0)) (not (= .cse7 .cse0)) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_32| .cse4 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse8 (select |v_#valid_BEFORE_CALL_32| .cse8)))) (= (select |v_#valid_BEFORE_CALL_32| .cse5) 1))) (not (= .cse7 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse7)) (not (= 0 .cse4))))) is different from false [2022-11-02 20:37:37,896 WARN L855 $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|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (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|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 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) (= |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|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_35| .cse2)))))) (or (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (and (<= 0 .cse3) (<= .cse3 0))) (= .cse5 .cse4) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0)) (not (= .cse7 .cse0)) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_32| .cse4 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse8 (select |v_#valid_BEFORE_CALL_32| .cse8)))) (= (select |v_#valid_BEFORE_CALL_32| .cse5) 1))) (not (= .cse7 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse7)) (not (= 0 .cse4))))) is different from true [2022-11-02 20:37:37,940 WARN L833 $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 ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (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|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse3 (select |v_#valid_BEFORE_CALL_35| .cse3)))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse6 (select |v_#valid_BEFORE_CALL_32| .cse6)))) (= (select |v_#valid_BEFORE_CALL_32| .cse4) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= .cse2 .cse0)) (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)) (not (= .cse2 |c_ULTIMATE.start_dll_append_~head#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse8 (select |v_#valid_BEFORE_CALL_31| .cse8)))) (<= .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))) (not (= 0 .cse5))))) is different from false [2022-11-02 20:37:37,945 WARN L855 $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 ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (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|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse3 (select |v_#valid_BEFORE_CALL_35| .cse3)))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse6 (select |v_#valid_BEFORE_CALL_32| .cse6)))) (= (select |v_#valid_BEFORE_CALL_32| .cse4) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= .cse2 .cse0)) (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)) (not (= .cse2 |c_ULTIMATE.start_dll_append_~head#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse8 (select |v_#valid_BEFORE_CALL_31| .cse8)))) (<= .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))) (not (= 0 .cse5))))) is different from true [2022-11-02 20:37:37,997 WARN L833 $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 ((.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)) (.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))) (.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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)) (= .cse0 0) (<= .cse1 |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) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_35| .cse2)))))) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse6 (select |v_#valid_BEFORE_CALL_32| .cse6)))) (= (select |v_#valid_BEFORE_CALL_32| .cse4) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 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)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse8 (select |v_#valid_BEFORE_CALL_31| .cse8)))) (<= .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))) (not (= 0 .cse5))))) is different from false [2022-11-02 20:37:38,001 WARN L855 $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 ((.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)) (.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))) (.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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)) (= .cse0 0) (<= .cse1 |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) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse2 (select |v_#valid_BEFORE_CALL_35| .cse2)))))) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse6 (select |v_#valid_BEFORE_CALL_32| .cse6)))) (= (select |v_#valid_BEFORE_CALL_32| .cse4) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 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)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse8 (select |v_#valid_BEFORE_CALL_31| .cse8)))) (<= .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))) (not (= 0 .cse5))))) is different from true [2022-11-02 20:37:38,052 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select |c_#memory_$Pointer$.base| .cse0)) (.cse11 (select |c_#memory_$Pointer$.offset| .cse0))) (let ((.cse7 (select .cse11 4)) (.cse2 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse0)) (.cse3 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse4 4)) (.cse5 (+ .cse1 4))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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| .cse0)) (= .cse1 0) (not .cse2) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 .cse5) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse3 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_35| .cse6)))))) (= .cse7 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse9 (select |v_#valid_BEFORE_CALL_32| .cse9)))) (= (select |v_#valid_BEFORE_CALL_32| .cse8) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse0 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse7) (<= .cse7 0)) .cse2 (= .cse8 .cse0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse10 (select |v_#valid_BEFORE_CALL_31| .cse10)))) (<= .cse3 |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))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse8) (not (= 0 .cse0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse11 .cse5)))))) is different from false [2022-11-02 20:37:38,057 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select |c_#memory_$Pointer$.base| .cse0)) (.cse11 (select |c_#memory_$Pointer$.offset| .cse0))) (let ((.cse7 (select .cse11 4)) (.cse2 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse0)) (.cse3 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse4 4)) (.cse5 (+ .cse1 4))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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| .cse0)) (= .cse1 0) (not .cse2) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 .cse5) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse3 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_35| .cse6)))))) (= .cse7 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse9 (select |v_#valid_BEFORE_CALL_32| .cse9)))) (= (select |v_#valid_BEFORE_CALL_32| .cse8) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse0 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse7) (<= .cse7 0)) .cse2 (= .cse8 .cse0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse10 (select |v_#valid_BEFORE_CALL_31| .cse10)))) (<= .cse3 |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))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse8) (not (= 0 .cse0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse11 .cse5)))))) is different from true [2022-11-02 20:37:38,106 WARN L833 $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$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1)) (.cse12 (select |c_#memory_$Pointer$.offset| .cse1))) (let ((.cse8 (select .cse12 4)) (.cse3 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (.cse4 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse9 (select .cse5 4)) (.cse6 (+ .cse2 4)) (.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (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| .cse1)) (= .cse2 0) (not .cse3) (<= .cse4 |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|) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse7 (select |v_#valid_BEFORE_CALL_35| .cse7)))))) (= .cse8 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse9) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse10 (select |v_#valid_BEFORE_CALL_32| .cse10)))) (= (select |v_#valid_BEFORE_CALL_32| .cse9) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse1 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse8) (<= .cse8 0)) .cse3 (= .cse9 .cse1)) (not (= |c_ULTIMATE.start_dll_append_~last~0#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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse11 (select |v_#valid_BEFORE_CALL_31| .cse11)))) (<= .cse4 |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))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse9) (not (= 0 .cse1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse12 .cse6)) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)))))) is different from false [2022-11-02 20:37:38,111 WARN L855 $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$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse1)) (.cse12 (select |c_#memory_$Pointer$.offset| .cse1))) (let ((.cse8 (select .cse12 4)) (.cse3 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1)) (.cse4 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse9 (select .cse5 4)) (.cse6 (+ .cse2 4)) (.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (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| .cse1)) (= .cse2 0) (not .cse3) (<= .cse4 |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|) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse7 (select |v_#valid_BEFORE_CALL_35| .cse7)))))) (= .cse8 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse9) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse10 (select |v_#valid_BEFORE_CALL_32| .cse10)))) (= (select |v_#valid_BEFORE_CALL_32| .cse9) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse1 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse8) (<= .cse8 0)) .cse3 (= .cse9 .cse1)) (not (= |c_ULTIMATE.start_dll_append_~last~0#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_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse11 (select |v_#valid_BEFORE_CALL_31| .cse11)))) (<= .cse4 |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))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse9) (not (= 0 .cse1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse12 .cse6)) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)))))) is different from true [2022-11-02 20:37:38,174 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select |c_#memory_$Pointer$.base| .cse0)) (.cse12 (select |c_#memory_$Pointer$.offset| .cse0))) (let ((.cse7 (select .cse12 4)) (.cse2 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse0)) (.cse10 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse3 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse4 4)) (.cse5 (+ .cse1 4))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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| .cse0)) (= .cse1 0) (not .cse2) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 .cse5) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse3 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_35| .cse6)))))) (= .cse7 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse9 (select |v_#valid_BEFORE_CALL_32| .cse9)))) (= (select |v_#valid_BEFORE_CALL_32| .cse8) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse0 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse7) (<= .cse7 0)) .cse2 (= .cse8 .cse0)) (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|) .cse10) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse10) 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse11 (select |v_#valid_BEFORE_CALL_31| .cse11)))) (<= .cse3 |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))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse8) (not (= 0 .cse0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse12 .cse5)))))) is different from false [2022-11-02 20:37:38,179 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select |c_#memory_$Pointer$.base| .cse0)) (.cse12 (select |c_#memory_$Pointer$.offset| .cse0))) (let ((.cse7 (select .cse12 4)) (.cse2 (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse0)) (.cse10 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse3 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse8 (select .cse4 4)) (.cse5 (+ .cse1 4))) (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 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| .cse0)) (= .cse1 0) (not .cse2) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 .cse5) |c_ULTIMATE.start_dll_append_~last~0#1.base|) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse3 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_35| .cse6)))))) (= .cse7 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_26| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_32| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse9 (select |v_#valid_BEFORE_CALL_32| .cse9)))) (= (select |v_#valid_BEFORE_CALL_32| .cse8) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse0 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (and (<= 0 .cse7) (<= .cse7 0)) .cse2 (= .cse8 .cse0)) (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|) .cse10) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse10) 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse11 (select |v_#valid_BEFORE_CALL_31| .cse11)))) (<= .cse3 |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))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse8) (not (= 0 .cse0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse12 .cse5)))))) is different from true [2022-11-02 20:37:38,246 WARN L833 $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 ((.cse5 (select (select |c_#memory_$Pointer$.offset| .cse7) 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse7)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select .cse6 (+ .cse2 4))) (.cse9 (+ .cse5 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse9))) (let ((.cse3 (+ .cse0 2))) (and (not (= .cse0 0)) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 8)) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (<= .cse3 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_35| .cse4)))))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse5 0) (not (= (select (select |c_#memory_$Pointer$.base| (select .cse6 4)) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_32| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= |v_#valid_BEFORE_CALL_32| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse8 (select |v_#valid_BEFORE_CALL_32| .cse8)))) (= (select (store |v_#valid_BEFORE_CALL_32| .cse7 1) .cse0) 0))) (or (and (<= 0 .cse5) (<= .cse5 0)) (= .cse1 .cse7) (= .cse0 .cse7)) (= 0 (select (select |c_#memory_$Pointer$.offset| .cse1) .cse9)) (not (= 0 .cse7)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse10 (select |v_#valid_BEFORE_CALL_31| .cse10)))) (<= .cse3 |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-02 20:37:38,252 WARN L855 $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 ((.cse5 (select (select |c_#memory_$Pointer$.offset| .cse7) 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse7)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select .cse6 (+ .cse2 4))) (.cse9 (+ .cse5 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse9))) (let ((.cse3 (+ .cse0 2))) (and (not (= .cse0 0)) (= .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 8)) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_28| (Array Int Int)) (v_arrayElimCell_216 Int)) (and (<= .cse3 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse4 (select |v_#valid_BEFORE_CALL_35| .cse4)))))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse5 0) (not (= (select (select |c_#memory_$Pointer$.base| (select .cse6 4)) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_32| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_32| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= |v_#valid_BEFORE_CALL_32| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse8 (select |v_#valid_BEFORE_CALL_32| .cse8)))) (= (select (store |v_#valid_BEFORE_CALL_32| .cse7 1) .cse0) 0))) (or (and (<= 0 .cse5) (<= .cse5 0)) (= .cse1 .cse7) (= .cse0 .cse7)) (= 0 (select (select |c_#memory_$Pointer$.offset| .cse1) .cse9)) (not (= 0 .cse7)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= |v_#valid_BEFORE_CALL_31| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse10 (select |v_#valid_BEFORE_CALL_31| .cse10)))) (<= .cse3 |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-02 20:37:38,324 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0) 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (v_arrayElimCell_216 Int) (v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| .cse1) 4)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse1) (+ .cse6 4))) (.cse5 (+ .cse2 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse4) .cse5))) (let ((.cse3 (+ 2 .cse8))) (and (= .cse1 |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) (<= 0 .cse2) (not (= .cse1 0)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse6) (= |v_#valid_BEFORE_CALL_31| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse2 0) (not (= v_arrayElimIndex_51 0)) (not (= .cse8 0)) (= (select |v_#valid_BEFORE_CALL_32| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= .cse6 0) (= .cse4 (select (select |c_#memory_$Pointer$.base| .cse8) 8)) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (<= .cse3 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_32| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse9 (select |v_#valid_BEFORE_CALL_32| .cse9)))) (= (select |v_#valid_BEFORE_CALL_32| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= (select (store |v_#valid_BEFORE_CALL_32| .cse1 1) .cse8) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_35| .cse10)))) (= 0 (select |v_old(#valid)_AFTER_CALL_26| .cse4))))))))) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0)) 4) 0)))) is different from false [2022-11-02 20:37:38,330 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0) 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (v_arrayElimCell_216 Int) (v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| .cse1) 4)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse1) (+ .cse6 4))) (.cse5 (+ .cse2 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse4) .cse5))) (let ((.cse3 (+ 2 .cse8))) (and (= .cse1 |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) (<= 0 .cse2) (not (= .cse1 0)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse6) (= |v_#valid_BEFORE_CALL_31| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse2 0) (not (= v_arrayElimIndex_51 0)) (not (= .cse8 0)) (= (select |v_#valid_BEFORE_CALL_32| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= .cse6 0) (= .cse4 (select (select |c_#memory_$Pointer$.base| .cse8) 8)) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (<= .cse3 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_32| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse9 (select |v_#valid_BEFORE_CALL_32| .cse9)))) (= (select |v_#valid_BEFORE_CALL_32| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (= (select (store |v_#valid_BEFORE_CALL_32| .cse1 1) .cse8) 0) (= |v_#valid_BEFORE_CALL_35| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse10 (select |v_#valid_BEFORE_CALL_35| .cse10)))) (= 0 (select |v_old(#valid)_AFTER_CALL_26| .cse4))))))))) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0)) 4) 0)))) is different from true [2022-11-02 20:37:38,400 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (v_arrayElimCell_216 Int) (v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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_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 ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) .cse7))) (let ((.cse4 (+ 2 .cse2))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (not (= .cse2 0)) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_32| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (= |v_#valid_BEFORE_CALL_31| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3)))) (= (select (select |c_#memory_$Pointer$.base| .cse2) 8) .cse1) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_32| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse0 1) .cse2) 0) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_32| .cse5)))) (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_old(#valid)_AFTER_CALL_26| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= |v_#valid_BEFORE_CALL_35| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_35| .cse6)))))))))) (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-02 20:37:38,405 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_35| (Array Int Int)) (v_arrayElimCell_216 Int) (v_arrayElimIndex_51 Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_24| (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_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 ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) .cse7))) (let ((.cse4 (+ 2 .cse2))) (and (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) 1) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (not (= .cse2 0)) (= (select |v_#valid_BEFORE_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_32| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimIndex_51) 0) (= |v_#valid_BEFORE_CALL_31| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_24| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3)))) (= (select (select |c_#memory_$Pointer$.base| .cse2) 8) .cse1) (= (select |v_old(#valid)_AFTER_CALL_26| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= v_arrayElimIndex_51 0)) (= (select |v_#valid_BEFORE_CALL_32| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_35| v_arrayElimCell_216) 1) (= (select (store |v_#valid_BEFORE_CALL_32| .cse0 1) .cse2) 0) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_28| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= |v_#valid_BEFORE_CALL_32| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_26| |v_#valid_BEFORE_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_26| .cse5 (select |v_#valid_BEFORE_CALL_32| .cse5)))) (<= .cse4 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_old(#valid)_AFTER_CALL_26| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (select |v_old(#valid)_AFTER_CALL_28| v_arrayElimCell_216) 0) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_21|) (= |v_#valid_BEFORE_CALL_35| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_28| |v_#valid_BEFORE_CALL_35|))) (store |v_old(#valid)_AFTER_CALL_28| .cse6 (select |v_#valid_BEFORE_CALL_35| .cse6)))))))))) (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-02 20:37:38,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:38,544 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-11-02 20:37:38,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-02 20:37:38,545 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-02 20:37:38,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:38,546 INFO L225 Difference]: With dead ends: 84 [2022-11-02 20:37:38,546 INFO L226 Difference]: Without dead ends: 81 [2022-11-02 20:37:38,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 50 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=205, Invalid=1535, Unknown=100, NotChecked=6350, Total=8190 [2022-11-02 20:37:38,550 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 436 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:38,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 180 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 198 Invalid, 0 Unknown, 436 Unchecked, 0.2s Time] [2022-11-02 20:37:38,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-02 20:37:38,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-11-02 20:37:38,577 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-02 20:37:38,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2022-11-02 20:37:38,578 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 46 [2022-11-02 20:37:38,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:38,579 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2022-11-02 20:37:38,579 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-02 20:37:38,579 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2022-11-02 20:37:38,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:37:38,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:38,581 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-02 20:37:38,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:37:38,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 20:37:38,802 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:37:38,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:38,803 INFO L85 PathProgramCache]: Analyzing trace with hash -397767570, now seen corresponding path program 2 times [2022-11-02 20:37:38,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:38,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684749311] [2022-11-02 20:37:38,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:38,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:40,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:37:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:41,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:37:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:41,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:37:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:41,561 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:37:41,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:41,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684749311] [2022-11-02 20:37:41,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684749311] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:41,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79618446] [2022-11-02 20:37:41,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:37:41,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:37:41,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:37:41,563 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:37:41,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_427e399e-5bf5-4f5a-8fcc-d41a74106bfb/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:37:41,873 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:37:41,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:37:41,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 166 conjunts are in the unsatisfiable core [2022-11-02 20:37:41,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:37:41,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:41,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:42,111 WARN L833 $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-02 20:37:42,113 WARN L855 $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-02 20:37:42,137 WARN L833 $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-02 20:37:42,139 WARN L855 $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-02 20:37:42,187 WARN L833 $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-02 20:37:42,189 WARN L855 $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-02 20:37:42,232 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (Array Int 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) (= (select |v_#valid_BEFORE_CALL_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_38| .cse0)))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2022-11-02 20:37:42,234 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (Array Int 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) (= (select |v_#valid_BEFORE_CALL_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_38| .cse0)))))) (= |c_#valid| |c_old(#valid)|)) is different from true [2022-11-02 20:37:42,264 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (Array Int 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) (= (select |v_#valid_BEFORE_CALL_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_38| .cse0)))))) (= |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-02 20:37:42,266 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (Array Int 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) (= (select |v_#valid_BEFORE_CALL_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_38| .cse0)))))) (= |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-02 20:37:42,314 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (Array Int 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) (= (select |v_#valid_BEFORE_CALL_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_38| .cse0)))))) (= |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)) is different from false [2022-11-02 20:37:42,316 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (Array Int 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) (= (select |v_#valid_BEFORE_CALL_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_38| .cse0)))))) (= |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)) is different from true [2022-11-02 20:37:42,399 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~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_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_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (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_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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_38| .cse1))))))) is different from false [2022-11-02 20:37:42,403 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~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_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_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (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_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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_38| .cse1))))))) is different from true [2022-11-02 20:37:42,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:42,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:42,493 WARN L833 $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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (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_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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse2 (select |v_#valid_BEFORE_CALL_38| .cse2)))))) (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= |v_#valid_BEFORE_CALL_39| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_#valid_BEFORE_CALL_39| .cse3)))) (= (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) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))))) is different from false [2022-11-02 20:37:42,497 WARN L855 $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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (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_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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse2 (select |v_#valid_BEFORE_CALL_38| .cse2)))))) (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= |v_#valid_BEFORE_CALL_39| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_#valid_BEFORE_CALL_39| .cse3)))) (= (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) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))))) is different from true [2022-11-02 20:37:42,541 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:37:42,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:42,559 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-02 20:37:42,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:42,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:42,607 WARN L833 $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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (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|)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (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_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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_38| .cse3)))))) (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= |v_#valid_BEFORE_CALL_39| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse4 (select |v_#valid_BEFORE_CALL_39| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_39| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))))) is different from false [2022-11-02 20:37:42,612 WARN L855 $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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (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|)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (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_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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_38| .cse3)))))) (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= |v_#valid_BEFORE_CALL_39| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse4 (select |v_#valid_BEFORE_CALL_39| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_39| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))))) is different from true [2022-11-02 20:37:42,693 WARN L833 $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) (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_39| |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_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))) (= .cse1 |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_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (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_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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_38| .cse3)))))))) is different from false [2022-11-02 20:37:42,697 WARN L855 $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) (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_29| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_39| |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_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))) (= .cse1 |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_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (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_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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_38| .cse3)))))))) is different from true [2022-11-02 20:37:42,840 WARN L833 $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) (or (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (<= .cse1 0) (<= 0 .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= |v_#valid_BEFORE_CALL_39| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse2 (select |v_#valid_BEFORE_CALL_39| .cse2)))) (= (select |v_#valid_BEFORE_CALL_39| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (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_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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_38| .cse3)))))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0))) is different from false [2022-11-02 20:37:42,844 WARN L855 $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) (or (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (<= .cse1 0) (<= 0 .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_29| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= |v_#valid_BEFORE_CALL_39| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse2 (select |v_#valid_BEFORE_CALL_39| .cse2)))) (= (select |v_#valid_BEFORE_CALL_39| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (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_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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_38| .cse3)))))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0))) is different from true [2022-11-02 20:37:42,959 WARN L833 $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)) (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_39| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_#valid_BEFORE_CALL_39| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_39| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_39| .cse1 1)) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |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_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (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_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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse4 (select |v_#valid_BEFORE_CALL_38| .cse4))))))))) is different from false [2022-11-02 20:37:42,963 WARN L855 $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)) (exists ((|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_39| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_#valid_BEFORE_CALL_39| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_29| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_39| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_39| .cse1 1)) (= (select |v_old(#valid)_AFTER_CALL_29| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |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_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (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_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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse4 (select |v_#valid_BEFORE_CALL_38| .cse4))))))))) is different from true [2022-11-02 20:37:42,989 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:37:42,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:42,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:42,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:43,056 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (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_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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_38| .cse0)))))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((v_arrayElimCell_246 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (v_arrayElimIndex_68 Int)) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_39| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1)))) is different from false [2022-11-02 20:37:43,060 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (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_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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse0 (select |v_#valid_BEFORE_CALL_38| .cse0)))))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((v_arrayElimCell_246 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (v_arrayElimIndex_68 Int)) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_39| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1)))) is different from true [2022-11-02 20:37:43,151 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_246 Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (v_arrayElimIndex_68 Int)) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (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_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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_38| .cse1)))))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2022-11-02 20:37:43,155 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_246 Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (v_arrayElimIndex_68 Int)) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (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_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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_38| .cse1)))))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2022-11-02 20:37:43,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:43,312 WARN L833 $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) (exists ((v_ArrVal_2755 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2755))) (exists ((v_ArrVal_2758 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2758))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_246 Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (v_arrayElimIndex_68 Int)) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1))) (= (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_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (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_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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_38| .cse1))))))) is different from false [2022-11-02 20:37:43,316 WARN L855 $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) (exists ((v_ArrVal_2755 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2755))) (exists ((v_ArrVal_2758 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2758))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_246 Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (v_arrayElimIndex_68 Int)) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1))) (= (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_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (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_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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_38| .cse1))))))) is different from true [2022-11-02 20:37:43,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:43,427 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:37:43,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:43,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:43,447 INFO L356 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2022-11-02 20:37:43,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:43,592 WARN L833 $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_append_~head#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_246 Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (v_arrayElimIndex_68 Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (= |v_#valid_BEFORE_CALL_39| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_39| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1))) (= (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_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_42| .cse2 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_33| .cse4 (select |v_#valid_BEFORE_CALL_42| .cse4))) |v_#valid_BEFORE_CALL_42|) (= (select |v_#valid_BEFORE_CALL_42| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_42| .cse3) 1))) (= |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|) |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (Array Int 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|) (= (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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse6 (select |v_#valid_BEFORE_CALL_38| .cse6))))))))) is different from false [2022-11-02 20:37:43,598 WARN L855 $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_append_~head#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_246 Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (v_arrayElimIndex_68 Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (= |v_#valid_BEFORE_CALL_39| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse1 (select |v_#valid_BEFORE_CALL_39| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1))) (= (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_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_42| .cse2 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_33| .cse4 (select |v_#valid_BEFORE_CALL_42| .cse4))) |v_#valid_BEFORE_CALL_42|) (= (select |v_#valid_BEFORE_CALL_42| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_42| .cse3) 1))) (= |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|) |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (Array Int 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|) (= (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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse6 (select |v_#valid_BEFORE_CALL_38| .cse6))))))))) is different from true [2022-11-02 20:37:43,807 WARN L833 $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)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (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) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_#valid_BEFORE_CALL_42| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_42| .cse1 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_33| .cse3 (select |v_#valid_BEFORE_CALL_42| .cse3))) |v_#valid_BEFORE_CALL_42|) (= (select |v_#valid_BEFORE_CALL_42| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_42| .cse2) 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|) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (= (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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= |v_#valid_BEFORE_CALL_38| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse4 (select |v_#valid_BEFORE_CALL_38| .cse4)))))) (or (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| .cse1) 4))) (and (<= 0 .cse5) (<= .cse5 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1) (= .cse2 .cse1)) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_246 Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (v_arrayElimIndex_68 Int)) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (= |v_#valid_BEFORE_CALL_39| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse6 (select |v_#valid_BEFORE_CALL_39| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1)))))) is different from false [2022-11-02 20:37:43,811 WARN L855 $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)) (.cse0 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (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) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_#valid_BEFORE_CALL_42| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_42| .cse1 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_33| .cse3 (select |v_#valid_BEFORE_CALL_42| .cse3))) |v_#valid_BEFORE_CALL_42|) (= (select |v_#valid_BEFORE_CALL_42| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_42| .cse2) 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|) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (= (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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= |v_#valid_BEFORE_CALL_38| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse4 (select |v_#valid_BEFORE_CALL_38| .cse4)))))) (or (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| .cse1) 4))) (and (<= 0 .cse5) (<= .cse5 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse1) (= .cse2 .cse1)) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_246 Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (v_arrayElimIndex_68 Int)) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (= |v_#valid_BEFORE_CALL_39| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse6 (select |v_#valid_BEFORE_CALL_39| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1)))))) is different from true [2022-11-02 20:37:43,973 WARN L833 $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$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (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) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_#valid_BEFORE_CALL_42| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_42| .cse2 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_33| .cse4 (select |v_#valid_BEFORE_CALL_42| .cse4))) |v_#valid_BEFORE_CALL_42|) (= (select |v_#valid_BEFORE_CALL_42| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_42| .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|) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (= (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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= |v_#valid_BEFORE_CALL_38| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse5 (select |v_#valid_BEFORE_CALL_38| .cse5)))))) (or (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= 0 .cse6) (<= .cse6 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2) (= .cse3 .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_246 Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (v_arrayElimIndex_68 Int)) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (= |v_#valid_BEFORE_CALL_39| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse7 (select |v_#valid_BEFORE_CALL_39| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1)))))) is different from false [2022-11-02 20:37:43,978 WARN L855 $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$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (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) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_#valid_BEFORE_CALL_42| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_42| .cse2 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_33| .cse4 (select |v_#valid_BEFORE_CALL_42| .cse4))) |v_#valid_BEFORE_CALL_42|) (= (select |v_#valid_BEFORE_CALL_42| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_42| .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|) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (= (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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= |v_#valid_BEFORE_CALL_38| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse5 (select |v_#valid_BEFORE_CALL_38| .cse5)))))) (or (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (and (<= 0 .cse6) (<= .cse6 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2) (= .cse3 .cse2)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_246 Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (v_arrayElimIndex_68 Int)) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (= |v_#valid_BEFORE_CALL_39| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse7 (select |v_#valid_BEFORE_CALL_39| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1)))))) is different from true [2022-11-02 20:37:44,259 WARN L833 $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 (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| .cse4))) (let ((.cse5 (select .cse2 4)) (.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse9 (select |c_#memory_$Pointer$.offset| .cse4)) (.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_33| (Array Int Int)) (|v_#valid_BEFORE_CALL_42| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_42| .cse4 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse5) 0) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_33| .cse6 (select |v_#valid_BEFORE_CALL_42| .cse6))) |v_#valid_BEFORE_CALL_42|) (= (select |v_#valid_BEFORE_CALL_42| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_42| .cse5) 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|) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (= (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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= |v_#valid_BEFORE_CALL_38| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse7 (select |v_#valid_BEFORE_CALL_38| .cse7)))))) (or (let ((.cse8 (select .cse9 4))) (and (<= 0 .cse8) (<= .cse8 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4) (= .cse5 .cse4)) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_246 Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (v_arrayElimIndex_68 Int)) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (= |v_#valid_BEFORE_CALL_39| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse10 (select |v_#valid_BEFORE_CALL_39| .cse10)))) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse9 .cse3)))))) is different from false [2022-11-02 20:37:44,265 WARN L855 $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 (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| .cse4))) (let ((.cse5 (select .cse2 4)) (.cse1 (+ 2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse9 (select |c_#memory_$Pointer$.offset| .cse4)) (.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_33| (Array Int Int)) (|v_#valid_BEFORE_CALL_42| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_42| .cse4 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse5) 0) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_33| .cse6 (select |v_#valid_BEFORE_CALL_42| .cse6))) |v_#valid_BEFORE_CALL_42|) (= (select |v_#valid_BEFORE_CALL_42| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_42| .cse5) 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|) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (= (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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= |v_#valid_BEFORE_CALL_38| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse7 (select |v_#valid_BEFORE_CALL_38| .cse7)))))) (or (let ((.cse8 (select .cse9 4))) (and (<= 0 .cse8) (<= .cse8 0))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4) (= .cse5 .cse4)) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_246 Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (v_arrayElimIndex_68 Int)) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (= |v_#valid_BEFORE_CALL_39| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse10 (select |v_#valid_BEFORE_CALL_39| .cse10)))) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse9 .cse3)))))) is different from true [2022-11-02 20:37:44,606 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:37:44,723 INFO L356 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2022-11-02 20:37:44,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:44,884 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-02 20:37:44,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:44,978 INFO L356 Elim1Store]: treesize reduction 120, result has 20.0 percent of original size [2022-11-02 20:37:44,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 346 [2022-11-02 20:37:44,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:45,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:45,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:45,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:45,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:45,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:45,082 INFO L356 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-02 20:37:45,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:45,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:45,233 WARN L833 $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 ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse4 (+ .cse7 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse0) .cse4))) (let ((.cse5 (+ 2 .cse3))) (and (exists ((|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_#valid_BEFORE_CALL_42| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_33| .cse1 (select |v_#valid_BEFORE_CALL_42| .cse1))) |v_#valid_BEFORE_CALL_42|) (= (select |v_#valid_BEFORE_CALL_42| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_42| .cse0) 1) (= (select (store |v_#valid_BEFORE_CALL_42| .cse2 1) .cse3) 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| .cse0) .cse4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_246 Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (v_arrayElimIndex_68 Int)) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (= |v_#valid_BEFORE_CALL_39| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse6 (select |v_#valid_BEFORE_CALL_39| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (<= .cse5 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1))) (or (and (<= 0 .cse7) (<= .cse7 0)) (= .cse0 .cse2) (= .cse3 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 0)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse8 (select |v_#valid_BEFORE_CALL_38| .cse8)))))))))))) is different from false [2022-11-02 20:37:45,239 WARN L855 $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 ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse2) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse4 (+ .cse7 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse0) .cse4))) (let ((.cse5 (+ 2 .cse3))) (and (exists ((|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_#valid_BEFORE_CALL_42| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_33| .cse1 (select |v_#valid_BEFORE_CALL_42| .cse1))) |v_#valid_BEFORE_CALL_42|) (= (select |v_#valid_BEFORE_CALL_42| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_42| .cse0) 1) (= (select (store |v_#valid_BEFORE_CALL_42| .cse2 1) .cse3) 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| .cse0) .cse4) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_246 Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (v_arrayElimIndex_68 Int)) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (= |v_#valid_BEFORE_CALL_39| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse6 (select |v_#valid_BEFORE_CALL_39| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (<= .cse5 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1))) (or (and (<= 0 .cse7) (<= .cse7 0)) (= .cse0 .cse2) (= .cse3 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 0)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (and (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= (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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse8 (select |v_#valid_BEFORE_CALL_38| .cse8)))))))))))) is different from true [2022-11-02 20:37:45,799 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int)) (v_arrayElimCell_246 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_#valid_BEFORE_CALL_42| (Array Int 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_arrayElimIndex_68 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 ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse8 (+ .cse1 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) .cse8))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 .cse6))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_#valid_BEFORE_CALL_39| .cse3)))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse4) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (<= .cse1 0) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_42| .cse5) 1) (= .cse4 0) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select (store |v_#valid_BEFORE_CALL_42| .cse0 1) .cse6) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_33| .cse7 (select |v_#valid_BEFORE_CALL_42| .cse7))) |v_#valid_BEFORE_CALL_42|) (= 0 (select |v_#valid_BEFORE_CALL_42| .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 0)) (= (select |v_old(#valid)_AFTER_CALL_33| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (<= .cse2 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse8) 0) (= |v_#valid_BEFORE_CALL_38| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse9 (select |v_#valid_BEFORE_CALL_38| .cse9))))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2022-11-02 20:37:45,803 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int)) (v_arrayElimCell_246 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_#valid_BEFORE_CALL_42| (Array Int 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_arrayElimIndex_68 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 ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse8 (+ .cse1 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) .cse8))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 .cse6))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (<= 0 .cse1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse3 (select |v_#valid_BEFORE_CALL_39| .cse3)))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse4) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (<= .cse1 0) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_42| .cse5) 1) (= .cse4 0) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select (store |v_#valid_BEFORE_CALL_42| .cse0 1) .cse6) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_33| .cse7 (select |v_#valid_BEFORE_CALL_42| .cse7))) |v_#valid_BEFORE_CALL_42|) (= 0 (select |v_#valid_BEFORE_CALL_42| .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 0)) (= (select |v_old(#valid)_AFTER_CALL_33| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (<= .cse2 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse8) 0) (= |v_#valid_BEFORE_CALL_38| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse9 (select |v_#valid_BEFORE_CALL_38| .cse9))))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2022-11-02 20:37:46,305 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int)) (v_arrayElimCell_246 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_#valid_BEFORE_CALL_42| (Array Int 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_arrayElimIndex_68 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$.offset| .cse7))) (let ((.cse0 (select .cse12 4)) (.cse1 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse5 (select .cse1 4)) (.cse10 (+ .cse0 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse5) .cse10))) (let ((.cse3 (+ 2 .cse8)) (.cse2 (+ .cse6 4))) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (<= 0 .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse1 .cse2)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse4 (select |v_#valid_BEFORE_CALL_39| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (<= .cse0 0) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_42| .cse5) 1) (= .cse6 0) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select (store |v_#valid_BEFORE_CALL_42| .cse7 1) .cse8) 0) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_33| .cse9 (select |v_#valid_BEFORE_CALL_42| .cse9))) |v_#valid_BEFORE_CALL_42|) (= 0 (select |v_#valid_BEFORE_CALL_42| .cse7)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (= (select |v_old(#valid)_AFTER_CALL_33| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (<= .cse3 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse10) 0) (= |v_#valid_BEFORE_CALL_38| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse11 (select |v_#valid_BEFORE_CALL_38| .cse11)))) (= (select .cse12 .cse2) |c_ULTIMATE.start_main_~ptr~0#1.offset|)))))))))) is different from false [2022-11-02 20:37:46,309 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_38| (Array Int Int)) (v_arrayElimCell_246 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_#valid_BEFORE_CALL_42| (Array Int 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_arrayElimIndex_68 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$.offset| .cse7))) (let ((.cse0 (select .cse12 4)) (.cse1 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse5 (select .cse1 4)) (.cse10 (+ .cse0 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse5) .cse10))) (let ((.cse3 (+ 2 .cse8)) (.cse2 (+ .cse6 4))) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (<= 0 .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse1 .cse2)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse4 (select |v_#valid_BEFORE_CALL_39| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24|) 1) (<= .cse0 0) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_42| .cse5) 1) (= .cse6 0) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 0) (= (select (store |v_#valid_BEFORE_CALL_42| .cse7 1) .cse8) 0) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_33| .cse9 (select |v_#valid_BEFORE_CALL_42| .cse9))) |v_#valid_BEFORE_CALL_42|) (= 0 (select |v_#valid_BEFORE_CALL_42| .cse7)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 0)) (= (select |v_old(#valid)_AFTER_CALL_33| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (<= .cse3 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse10) 0) (= |v_#valid_BEFORE_CALL_38| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse11 (select |v_#valid_BEFORE_CALL_38| .cse11)))) (= (select .cse12 .cse2) |c_ULTIMATE.start_main_~ptr~0#1.offset|)))))))))) is different from true [2022-11-02 20:37:46,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:37:46,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:46,653 INFO L356 Elim1Store]: treesize reduction 93, result has 7.0 percent of original size [2022-11-02 20:37:46,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:46,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:46,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:46,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:46,711 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-11-02 20:37:46,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:46,806 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimIndex_81 Int) (v_arrayElimIndex_80 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (= (select (store |v_#valid_BEFORE_CALL_42| v_arrayElimIndex_80 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimIndex_81) 0) (= (select |v_#valid_BEFORE_CALL_42| v_arrayElimIndex_81) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_33| .cse0 (select |v_#valid_BEFORE_CALL_42| .cse0))) |v_#valid_BEFORE_CALL_42|) (= (select |v_old(#valid)_AFTER_CALL_33| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_42| v_arrayElimIndex_80) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_246 Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (v_arrayElimIndex_68 Int)) (and (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (= |v_#valid_BEFORE_CALL_39| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse2 (select |v_#valid_BEFORE_CALL_39| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (Array Int 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|) (= (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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_38| .cse3)))))))) is different from false [2022-11-02 20:37:46,811 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimIndex_81 Int) (v_arrayElimIndex_80 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (= (select (store |v_#valid_BEFORE_CALL_42| v_arrayElimIndex_80 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimIndex_81) 0) (= (select |v_#valid_BEFORE_CALL_42| v_arrayElimIndex_81) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_33| .cse0 (select |v_#valid_BEFORE_CALL_42| .cse0))) |v_#valid_BEFORE_CALL_42|) (= (select |v_old(#valid)_AFTER_CALL_33| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_42| v_arrayElimIndex_80) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_246 Int) (|v_old(#valid)_AFTER_CALL_29| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (v_arrayElimIndex_68 Int)) (and (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimIndex_68) 0) (= |v_#valid_BEFORE_CALL_39| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_29| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_29| .cse2 (select |v_#valid_BEFORE_CALL_39| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_29| v_arrayElimCell_246) 0) (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_246) 1) (= (select |v_old(#valid)_AFTER_CALL_29| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_24| Int) (|v_#valid_BEFORE_CALL_38| (Array Int 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|) (= (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_38| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_8|) 1) (= |v_#valid_BEFORE_CALL_38| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_38|))) (store |v_old(#valid)_AFTER_CALL_31| .cse3 (select |v_#valid_BEFORE_CALL_38| .cse3)))))))) is different from true [2022-11-02 20:37:46,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:46,896 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-02 20:37:46,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:37:47,081 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2763 (Array Int Int)) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2770 (Array Int Int)) (v_ArrVal_2769 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_2763)) (.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_2762))) (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_2770))) (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_2769))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3)))))))) is different from false [2022-11-02 20:37:47,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2763 (Array Int Int)) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2770 (Array Int Int)) (v_ArrVal_2769 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_2763)) (.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_2762))) (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_2770))) (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_2769))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))))) is different from false [2022-11-02 20:37:47,158 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2763 (Array Int Int)) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2770 (Array Int Int)) (v_ArrVal_2769 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_2763)) (.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_2762))) (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_2770))) (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_2769))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))))) is different from false [2022-11-02 20:37:47,183 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2763 (Array Int Int)) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2770 (Array Int Int)) (v_ArrVal_2769 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_2763)) (.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_2762))) (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_2770))) (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_2769))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))))) is different from false [2022-11-02 20:37:47,312 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:37:47,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:37:47,334 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:37:47,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14576 treesize of output 13924 [2022-11-02 20:37:47,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15880 treesize of output 13272 [2022-11-02 20:37:47,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4639 treesize of output 3335 [2022-11-02 20:37:49,095 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:37:49,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 9257 treesize of output 16475