./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2c_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:42:10,719 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:42:10,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:42:10,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:42:10,761 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:42:10,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:42:10,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:42:10,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:42:10,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:42:10,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:42:10,778 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:42:10,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:42:10,780 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:42:10,782 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:42:10,783 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:42:10,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:42:10,785 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:42:10,786 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:42:10,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:42:10,791 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:42:10,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:42:10,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:42:10,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:42:10,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:42:10,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:42:10,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:42:10,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:42:10,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:42:10,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:42:10,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:42:10,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:42:10,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:42:10,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:42:10,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:42:10,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:42:10,811 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:42:10,812 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:42:10,812 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:42:10,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:42:10,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:42:10,814 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:42:10,815 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:42:10,859 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:42:10,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:42:10,861 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:42:10,861 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:42:10,862 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:42:10,862 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:42:10,863 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:42:10,863 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:42:10,863 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:42:10,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:42:10,864 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:42:10,864 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:42:10,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:42:10,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:42:10,865 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:42:10,865 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:42:10,865 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:42:10,865 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:42:10,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:42:10,866 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:42:10,866 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:42:10,866 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:42:10,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:42:10,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:42:10,867 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:42:10,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:42:10,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:42:10,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:42:10,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:42:10,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:42:10,868 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:42:10,868 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:42:10,869 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:42:10,869 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:42:10,869 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc [2023-02-16 03:42:11,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:42:11,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:42:11,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:42:11,146 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:42:11,146 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:42:11,147 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_append_equal.i [2023-02-16 03:42:12,294 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:42:12,521 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:42:12,521 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_equal.i [2023-02-16 03:42:12,532 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16ec2c9de/3945749ccf5443149cc5a927ef87450a/FLAG8a3f57c6f [2023-02-16 03:42:12,550 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16ec2c9de/3945749ccf5443149cc5a927ef87450a [2023-02-16 03:42:12,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:42:12,554 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:42:12,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:42:12,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:42:12,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:42:12,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:42:12" (1/1) ... [2023-02-16 03:42:12,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72858622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:12, skipping insertion in model container [2023-02-16 03:42:12,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:42:12" (1/1) ... [2023-02-16 03:42:12,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:42:12,604 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:42:12,904 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_equal.i[24585,24598] [2023-02-16 03:42:12,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:42:12,917 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:42:12,961 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_equal.i[24585,24598] [2023-02-16 03:42:12,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:42:12,996 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:42:13,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:13 WrapperNode [2023-02-16 03:42:13,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:42:13,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:42:13,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:42:13,005 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:42:13,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:13" (1/1) ... [2023-02-16 03:42:13,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:13" (1/1) ... [2023-02-16 03:42:13,042 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 140 [2023-02-16 03:42:13,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:42:13,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:42:13,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:42:13,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:42:13,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:13" (1/1) ... [2023-02-16 03:42:13,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:13" (1/1) ... [2023-02-16 03:42:13,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:13" (1/1) ... [2023-02-16 03:42:13,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:13" (1/1) ... [2023-02-16 03:42:13,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:13" (1/1) ... [2023-02-16 03:42:13,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:13" (1/1) ... [2023-02-16 03:42:13,067 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:13" (1/1) ... [2023-02-16 03:42:13,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:13" (1/1) ... [2023-02-16 03:42:13,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:42:13,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:42:13,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:42:13,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:42:13,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:13" (1/1) ... [2023-02-16 03:42:13,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:42:13,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:13,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-16 03:42:13,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-16 03:42:13,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 03:42:13,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 03:42:13,144 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-16 03:42:13,145 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-16 03:42:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:42:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:42:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 03:42:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:42:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:42:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:42:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-16 03:42:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 03:42:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:42:13,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:42:13,266 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:42:13,267 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:42:13,617 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:42:13,623 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:42:13,624 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-16 03:42:13,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:42:13 BoogieIcfgContainer [2023-02-16 03:42:13,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:42:13,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:42:13,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:42:13,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:42:13,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:42:12" (1/3) ... [2023-02-16 03:42:13,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ebca8e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:42:13, skipping insertion in model container [2023-02-16 03:42:13,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:13" (2/3) ... [2023-02-16 03:42:13,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ebca8e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:42:13, skipping insertion in model container [2023-02-16 03:42:13,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:42:13" (3/3) ... [2023-02-16 03:42:13,636 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal.i [2023-02-16 03:42:13,647 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:42:13,647 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2023-02-16 03:42:13,683 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:42:13,688 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@538ed0a3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:42:13,689 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2023-02-16 03:42:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 66 states have (on average 2.090909090909091) internal successors, (138), 126 states have internal predecessors, (138), 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) [2023-02-16 03:42:13,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:42:13,697 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:13,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:42:13,698 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:13,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:13,706 INFO L85 PathProgramCache]: Analyzing trace with hash 895333938, now seen corresponding path program 1 times [2023-02-16 03:42:13,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:13,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753335512] [2023-02-16 03:42:13,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:13,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:13,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:42:13,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:13,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753335512] [2023-02-16 03:42:13,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753335512] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:13,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:42:13,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:42:13,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368293646] [2023-02-16 03:42:13,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:13,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:42:13,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:14,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:42:14,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:42:14,014 INFO L87 Difference]: Start difference. First operand has 131 states, 66 states have (on average 2.090909090909091) internal successors, (138), 126 states have internal predecessors, (138), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:42:14,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:14,135 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2023-02-16 03:42:14,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:42:14,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-16 03:42:14,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:14,144 INFO L225 Difference]: With dead ends: 128 [2023-02-16 03:42:14,144 INFO L226 Difference]: Without dead ends: 125 [2023-02-16 03:42:14,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:42:14,149 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 10 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:14,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 195 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:42:14,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-16 03:42:14,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-02-16 03:42:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 64 states have (on average 1.984375) internal successors, (127), 120 states have internal predecessors, (127), 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) [2023-02-16 03:42:14,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2023-02-16 03:42:14,195 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 6 [2023-02-16 03:42:14,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:14,196 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2023-02-16 03:42:14,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:42:14,196 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2023-02-16 03:42:14,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:42:14,197 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:14,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:42:14,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 03:42:14,199 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:14,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:14,200 INFO L85 PathProgramCache]: Analyzing trace with hash 895333939, now seen corresponding path program 1 times [2023-02-16 03:42:14,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:14,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106827760] [2023-02-16 03:42:14,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:14,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:42:14,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:14,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106827760] [2023-02-16 03:42:14,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106827760] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:14,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:42:14,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:42:14,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889580883] [2023-02-16 03:42:14,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:14,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:42:14,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:14,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:42:14,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:42:14,292 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:42:14,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:14,367 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2023-02-16 03:42:14,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:42:14,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-16 03:42:14,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:14,369 INFO L225 Difference]: With dead ends: 122 [2023-02-16 03:42:14,369 INFO L226 Difference]: Without dead ends: 122 [2023-02-16 03:42:14,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:42:14,371 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:14,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 197 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:42:14,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-16 03:42:14,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-02-16 03:42:14,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.9375) internal successors, (124), 117 states have internal predecessors, (124), 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) [2023-02-16 03:42:14,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2023-02-16 03:42:14,379 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 6 [2023-02-16 03:42:14,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:14,380 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2023-02-16 03:42:14,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:42:14,380 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2023-02-16 03:42:14,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-16 03:42:14,381 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:14,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:14,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 03:42:14,381 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:14,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:14,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1787864811, now seen corresponding path program 1 times [2023-02-16 03:42:14,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:14,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915107973] [2023-02-16 03:42:14,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:14,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:14,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:14,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:42:14,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:14,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915107973] [2023-02-16 03:42:14,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915107973] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:14,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:42:14,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:42:14,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200705339] [2023-02-16 03:42:14,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:14,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:42:14,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:14,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:42:14,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:42:14,570 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2023-02-16 03:42:14,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:14,703 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2023-02-16 03:42:14,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:42:14,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2023-02-16 03:42:14,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:14,707 INFO L225 Difference]: With dead ends: 133 [2023-02-16 03:42:14,707 INFO L226 Difference]: Without dead ends: 133 [2023-02-16 03:42:14,710 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 [2023-02-16 03:42:14,713 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 10 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:14,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 295 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:42:14,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-16 03:42:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2023-02-16 03:42:14,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 65 states have (on average 1.9230769230769231) internal successors, (125), 118 states have internal predecessors, (125), 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) [2023-02-16 03:42:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2023-02-16 03:42:14,727 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 14 [2023-02-16 03:42:14,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:14,727 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2023-02-16 03:42:14,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2023-02-16 03:42:14,727 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2023-02-16 03:42:14,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 03:42:14,728 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:14,728 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:14,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 03:42:14,728 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:14,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:14,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1282134272, now seen corresponding path program 1 times [2023-02-16 03:42:14,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:14,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121066270] [2023-02-16 03:42:14,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:14,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:14,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:14,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:42:14,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:14,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121066270] [2023-02-16 03:42:14,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121066270] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:14,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:42:14,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:42:14,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021153886] [2023-02-16 03:42:14,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:14,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:42:14,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:14,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:42:14,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:42:14,987 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:42:15,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:15,240 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2023-02-16 03:42:15,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:42:15,241 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-16 03:42:15,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:15,243 INFO L225 Difference]: With dead ends: 123 [2023-02-16 03:42:15,243 INFO L226 Difference]: Without dead ends: 123 [2023-02-16 03:42:15,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:42:15,250 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 21 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:15,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 400 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:42:15,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-16 03:42:15,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2023-02-16 03:42:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 65 states have (on average 1.9076923076923078) internal successors, (124), 117 states have internal predecessors, (124), 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) [2023-02-16 03:42:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2023-02-16 03:42:15,262 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 24 [2023-02-16 03:42:15,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:15,262 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2023-02-16 03:42:15,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:42:15,263 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2023-02-16 03:42:15,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 03:42:15,263 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:15,263 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:15,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 03:42:15,264 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:15,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:15,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1282134271, now seen corresponding path program 1 times [2023-02-16 03:42:15,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:15,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024173542] [2023-02-16 03:42:15,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:15,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:15,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:15,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:42:15,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:15,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024173542] [2023-02-16 03:42:15,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024173542] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:15,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:42:15,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:42:15,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920420819] [2023-02-16 03:42:15,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:15,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:42:15,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:15,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:42:15,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:42:15,517 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:42:15,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:15,746 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2023-02-16 03:42:15,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:42:15,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-16 03:42:15,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:15,748 INFO L225 Difference]: With dead ends: 122 [2023-02-16 03:42:15,752 INFO L226 Difference]: Without dead ends: 122 [2023-02-16 03:42:15,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:42:15,753 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 19 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:15,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 424 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:42:15,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-16 03:42:15,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2023-02-16 03:42:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 65 states have (on average 1.8923076923076922) internal successors, (123), 116 states have internal predecessors, (123), 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) [2023-02-16 03:42:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2023-02-16 03:42:15,766 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 24 [2023-02-16 03:42:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:15,766 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2023-02-16 03:42:15,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:42:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2023-02-16 03:42:15,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 03:42:15,767 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:15,767 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:15,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 03:42:15,768 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:15,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:15,769 INFO L85 PathProgramCache]: Analyzing trace with hash 524578273, now seen corresponding path program 1 times [2023-02-16 03:42:15,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:15,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188669235] [2023-02-16 03:42:15,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:15,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:15,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:15,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:42:16,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:16,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188669235] [2023-02-16 03:42:16,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188669235] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:16,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966964907] [2023-02-16 03:42:16,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:16,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:16,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:16,039 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:42:16,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 03:42:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:16,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-16 03:42:16,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:16,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:42:16,314 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-16 03:42:16,405 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:42:16,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 03:42:16,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-02-16 03:42:16,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:42:16,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966964907] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:16,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:42:16,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2023-02-16 03:42:16,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943907813] [2023-02-16 03:42:16,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:42:16,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 03:42:16,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:16,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 03:42:16,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2023-02-16 03:42:16,488 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:42:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:16,821 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2023-02-16 03:42:16,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:42:16,822 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2023-02-16 03:42:16,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:16,823 INFO L225 Difference]: With dead ends: 146 [2023-02-16 03:42:16,823 INFO L226 Difference]: Without dead ends: 146 [2023-02-16 03:42:16,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2023-02-16 03:42:16,825 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 99 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:16,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 379 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 423 Invalid, 0 Unknown, 150 Unchecked, 0.3s Time] [2023-02-16 03:42:16,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-16 03:42:16,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2023-02-16 03:42:16,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 69 states have (on average 1.8695652173913044) internal successors, (129), 120 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:42:16,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2023-02-16 03:42:16,833 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 26 [2023-02-16 03:42:16,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:16,833 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2023-02-16 03:42:16,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:42:16,834 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2023-02-16 03:42:16,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 03:42:16,835 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:16,835 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:16,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 03:42:17,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-16 03:42:17,041 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:17,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:17,042 INFO L85 PathProgramCache]: Analyzing trace with hash 524578274, now seen corresponding path program 1 times [2023-02-16 03:42:17,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:17,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755718281] [2023-02-16 03:42:17,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:17,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:17,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:17,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:42:17,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:17,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755718281] [2023-02-16 03:42:17,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755718281] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:17,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867765992] [2023-02-16 03:42:17,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:17,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:17,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:17,489 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:42:17,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 03:42:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:17,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-16 03:42:17,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:17,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:42:17,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:42:17,760 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_494 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_494))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-16 03:42:17,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:17,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:42:17,830 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:42:17,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-16 03:42:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-02-16 03:42:17,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:42:17,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867765992] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:17,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:42:17,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2023-02-16 03:42:17,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720715563] [2023-02-16 03:42:17,949 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:42:17,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 03:42:17,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:17,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 03:42:17,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=173, Unknown=1, NotChecked=26, Total=240 [2023-02-16 03:42:17,951 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:42:18,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:18,307 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2023-02-16 03:42:18,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:42:18,309 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2023-02-16 03:42:18,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:18,310 INFO L225 Difference]: With dead ends: 128 [2023-02-16 03:42:18,310 INFO L226 Difference]: Without dead ends: 128 [2023-02-16 03:42:18,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=219, Unknown=1, NotChecked=30, Total=306 [2023-02-16 03:42:18,311 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 10 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:18,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 486 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 414 Invalid, 0 Unknown, 123 Unchecked, 0.3s Time] [2023-02-16 03:42:18,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-16 03:42:18,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2023-02-16 03:42:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 69 states have (on average 1.855072463768116) internal successors, (128), 120 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:42:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2023-02-16 03:42:18,314 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 26 [2023-02-16 03:42:18,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:18,315 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2023-02-16 03:42:18,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:42:18,315 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2023-02-16 03:42:18,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 03:42:18,315 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:18,315 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:18,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-16 03:42:18,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-02-16 03:42:18,522 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:18,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:18,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1608700855, now seen corresponding path program 1 times [2023-02-16 03:42:18,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:18,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724776617] [2023-02-16 03:42:18,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:18,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:18,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:18,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:42:18,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:18,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724776617] [2023-02-16 03:42:18,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724776617] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:18,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061057446] [2023-02-16 03:42:18,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:18,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:18,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:18,679 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:42:18,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 03:42:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:18,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 03:42:18,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:18,844 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:42:18,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:42:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:42:18,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061057446] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:42:18,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:42:18,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-02-16 03:42:18,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097422294] [2023-02-16 03:42:18,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:42:18,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:42:18,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:18,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:42:18,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:42:18,901 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:42:19,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:19,043 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2023-02-16 03:42:19,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:42:19,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-02-16 03:42:19,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:19,045 INFO L225 Difference]: With dead ends: 127 [2023-02-16 03:42:19,045 INFO L226 Difference]: Without dead ends: 127 [2023-02-16 03:42:19,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:42:19,046 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:19,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 618 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:42:19,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-16 03:42:19,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2023-02-16 03:42:19,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 69 states have (on average 1.8405797101449275) internal successors, (127), 120 states have internal predecessors, (127), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:42:19,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2023-02-16 03:42:19,049 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 28 [2023-02-16 03:42:19,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:19,050 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2023-02-16 03:42:19,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:42:19,050 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2023-02-16 03:42:19,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 03:42:19,051 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:19,051 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:19,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 03:42:19,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:19,258 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:19,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:19,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1674661710, now seen corresponding path program 1 times [2023-02-16 03:42:19,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:19,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628786090] [2023-02-16 03:42:19,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:19,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:19,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:19,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:19,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:42:19,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:19,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628786090] [2023-02-16 03:42:19,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628786090] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:19,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64032691] [2023-02-16 03:42:19,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:19,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:19,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:19,370 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:42:19,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 03:42:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:19,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-16 03:42:19,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:42:19,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:42:19,555 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 03:42:19,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2023-02-16 03:42:19,574 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:42:19,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64032691] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:42:19,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:42:19,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2023-02-16 03:42:19,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840065424] [2023-02-16 03:42:19,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:42:19,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:42:19,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:19,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:42:19,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:42:19,577 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:42:19,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:19,758 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2023-02-16 03:42:19,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:42:19,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-02-16 03:42:19,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:19,760 INFO L225 Difference]: With dead ends: 131 [2023-02-16 03:42:19,760 INFO L226 Difference]: Without dead ends: 131 [2023-02-16 03:42:19,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:42:19,762 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 11 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:19,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 403 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:42:19,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-16 03:42:19,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2023-02-16 03:42:19,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 72 states have (on average 1.8333333333333333) internal successors, (132), 123 states have internal predecessors, (132), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:42:19,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2023-02-16 03:42:19,766 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 29 [2023-02-16 03:42:19,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:19,766 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2023-02-16 03:42:19,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:42:19,767 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2023-02-16 03:42:19,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 03:42:19,769 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:19,769 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:19,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 03:42:19,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:19,977 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:19,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:19,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1674661709, now seen corresponding path program 1 times [2023-02-16 03:42:19,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:19,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428863245] [2023-02-16 03:42:19,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:19,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:20,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:20,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:42:20,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:20,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428863245] [2023-02-16 03:42:20,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428863245] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:20,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249329129] [2023-02-16 03:42:20,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:20,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:20,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:20,217 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:42:20,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 03:42:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:20,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-16 03:42:20,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:42:20,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:42:20,469 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:42:20,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2023-02-16 03:42:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:42:20,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249329129] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:42:20,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:42:20,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2023-02-16 03:42:20,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240898949] [2023-02-16 03:42:20,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:42:20,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-16 03:42:20,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:20,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-16 03:42:20,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-02-16 03:42:20,610 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-16 03:42:20,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:20,871 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2023-02-16 03:42:20,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:42:20,872 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2023-02-16 03:42:20,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:20,873 INFO L225 Difference]: With dead ends: 136 [2023-02-16 03:42:20,873 INFO L226 Difference]: Without dead ends: 136 [2023-02-16 03:42:20,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-02-16 03:42:20,874 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 18 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:20,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1166 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:42:20,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-16 03:42:20,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2023-02-16 03:42:20,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 72 states have (on average 1.8194444444444444) internal successors, (131), 123 states have internal predecessors, (131), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:42:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2023-02-16 03:42:20,878 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 29 [2023-02-16 03:42:20,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:20,879 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2023-02-16 03:42:20,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-16 03:42:20,879 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2023-02-16 03:42:20,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-16 03:42:20,882 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:20,882 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:20,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 03:42:21,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-16 03:42:21,083 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:21,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:21,084 INFO L85 PathProgramCache]: Analyzing trace with hash -374905453, now seen corresponding path program 1 times [2023-02-16 03:42:21,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:21,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889655442] [2023-02-16 03:42:21,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:21,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:21,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:21,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:42:21,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:21,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889655442] [2023-02-16 03:42:21,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889655442] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:21,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:42:21,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:42:21,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824122370] [2023-02-16 03:42:21,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:21,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:42:21,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:21,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:42:21,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:42:21,227 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:42:21,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:21,465 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2023-02-16 03:42:21,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:42:21,466 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-02-16 03:42:21,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:21,467 INFO L225 Difference]: With dead ends: 129 [2023-02-16 03:42:21,467 INFO L226 Difference]: Without dead ends: 129 [2023-02-16 03:42:21,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:42:21,468 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 24 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:21,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 445 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:42:21,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-16 03:42:21,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2023-02-16 03:42:21,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 72 states have (on average 1.8055555555555556) internal successors, (130), 122 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:42:21,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2023-02-16 03:42:21,471 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 30 [2023-02-16 03:42:21,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:21,471 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2023-02-16 03:42:21,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:42:21,472 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2023-02-16 03:42:21,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-16 03:42:21,472 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:21,472 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:21,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-16 03:42:21,472 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:21,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:21,473 INFO L85 PathProgramCache]: Analyzing trace with hash -374905452, now seen corresponding path program 1 times [2023-02-16 03:42:21,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:21,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834294998] [2023-02-16 03:42:21,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:21,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:21,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:21,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:42:21,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:21,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834294998] [2023-02-16 03:42:21,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834294998] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:21,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:42:21,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:42:21,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83412581] [2023-02-16 03:42:21,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:21,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:42:21,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:21,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:42:21,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:42:21,712 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:42:21,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:21,957 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2023-02-16 03:42:21,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:42:21,958 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-02-16 03:42:21,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:21,959 INFO L225 Difference]: With dead ends: 127 [2023-02-16 03:42:21,959 INFO L226 Difference]: Without dead ends: 127 [2023-02-16 03:42:21,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:42:21,959 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 20 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:21,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 475 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:42:21,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-16 03:42:21,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-02-16 03:42:21,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 72 states have (on average 1.7916666666666667) internal successors, (129), 121 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:42:21,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2023-02-16 03:42:21,963 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 30 [2023-02-16 03:42:21,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:21,963 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2023-02-16 03:42:21,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:42:21,963 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2023-02-16 03:42:21,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 03:42:21,964 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:21,964 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:21,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-16 03:42:21,964 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:21,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:21,965 INFO L85 PathProgramCache]: Analyzing trace with hash -688454360, now seen corresponding path program 1 times [2023-02-16 03:42:21,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:21,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664526773] [2023-02-16 03:42:21,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:21,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:22,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:22,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:22,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-16 03:42:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-16 03:42:22,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:22,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664526773] [2023-02-16 03:42:22,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664526773] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:22,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474064575] [2023-02-16 03:42:22,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:22,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:22,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:22,108 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:42:22,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-16 03:42:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:22,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 03:42:22,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:22,314 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:42:22,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:42:22,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474064575] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:22,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 03:42:22,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-02-16 03:42:22,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210312924] [2023-02-16 03:42:22,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:22,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:42:22,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:22,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:42:22,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:42:22,317 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:42:22,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:22,328 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2023-02-16 03:42:22,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:42:22,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2023-02-16 03:42:22,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:22,329 INFO L225 Difference]: With dead ends: 115 [2023-02-16 03:42:22,329 INFO L226 Difference]: Without dead ends: 115 [2023-02-16 03:42:22,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:42:22,330 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 198 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:22,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 134 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:42:22,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-16 03:42:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-02-16 03:42:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 110 states have internal predecessors, (115), 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) [2023-02-16 03:42:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2023-02-16 03:42:22,334 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 41 [2023-02-16 03:42:22,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:22,334 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2023-02-16 03:42:22,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:42:22,335 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2023-02-16 03:42:22,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 03:42:22,335 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:22,335 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:22,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-16 03:42:22,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:22,543 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:22,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:22,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1191008248, now seen corresponding path program 1 times [2023-02-16 03:42:22,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:22,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371563469] [2023-02-16 03:42:22,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:22,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:22,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:22,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:22,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:22,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:42:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:23,053 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-16 03:42:23,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:23,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371563469] [2023-02-16 03:42:23,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371563469] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:23,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259550842] [2023-02-16 03:42:23,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:23,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:23,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:23,057 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:42:23,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-16 03:42:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:23,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-16 03:42:23,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:23,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:42:23,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:42:23,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:23,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-02-16 03:42:23,375 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-02-16 03:42:23,401 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:42:23,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:42:23,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:23,526 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-02-16 03:42:23,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2023-02-16 03:42:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 14 not checked. [2023-02-16 03:42:23,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:42:23,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259550842] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:23,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:42:23,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2023-02-16 03:42:23,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685910966] [2023-02-16 03:42:23,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:42:23,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-16 03:42:23,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:23,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-16 03:42:23,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=280, Unknown=1, NotChecked=34, Total=380 [2023-02-16 03:42:23,706 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 17 states, 16 states have (on average 3.375) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:42:24,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:24,162 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2023-02-16 03:42:24,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:42:24,162 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.375) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2023-02-16 03:42:24,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:24,163 INFO L225 Difference]: With dead ends: 125 [2023-02-16 03:42:24,163 INFO L226 Difference]: Without dead ends: 125 [2023-02-16 03:42:24,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=487, Unknown=1, NotChecked=46, Total=650 [2023-02-16 03:42:24,164 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 346 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:24,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 308 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 450 Invalid, 0 Unknown, 125 Unchecked, 0.4s Time] [2023-02-16 03:42:24,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-16 03:42:24,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2023-02-16 03:42:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 65 states have (on average 1.646153846153846) internal successors, (107), 102 states have internal predecessors, (107), 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) [2023-02-16 03:42:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2023-02-16 03:42:24,173 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 43 [2023-02-16 03:42:24,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:24,174 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2023-02-16 03:42:24,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.375) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:42:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2023-02-16 03:42:24,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 03:42:24,174 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:24,175 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:24,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-16 03:42:24,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:24,382 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:24,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:24,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1191008247, now seen corresponding path program 1 times [2023-02-16 03:42:24,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:24,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059338541] [2023-02-16 03:42:24,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:24,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:24,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:24,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:24,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:42:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:25,056 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:42:25,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:25,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059338541] [2023-02-16 03:42:25,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059338541] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:25,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016337649] [2023-02-16 03:42:25,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:25,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:25,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:25,058 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:42:25,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-16 03:42:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:25,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-16 03:42:25,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:25,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:42:25,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:42:25,300 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1821 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1821))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-16 03:42:25,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:25,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:42:25,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:42:25,370 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1822 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1822))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-16 03:42:25,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:25,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:42:25,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:42:25,469 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1823 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1823))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-16 03:42:25,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:25,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:42:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2023-02-16 03:42:25,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:42:26,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016337649] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:26,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:42:26,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2023-02-16 03:42:26,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106626921] [2023-02-16 03:42:26,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:42:26,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-16 03:42:26,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:26,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-16 03:42:26,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=287, Unknown=3, NotChecked=108, Total=462 [2023-02-16 03:42:26,714 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 20 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 states have internal predecessors, (73), 4 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:42:27,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:27,108 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2023-02-16 03:42:27,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:42:27,108 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 states have internal predecessors, (73), 4 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2023-02-16 03:42:27,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:27,109 INFO L225 Difference]: With dead ends: 117 [2023-02-16 03:42:27,109 INFO L226 Difference]: Without dead ends: 117 [2023-02-16 03:42:27,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=110, Invalid=451, Unknown=3, NotChecked=138, Total=702 [2023-02-16 03:42:27,110 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 568 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 294 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:27,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 167 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 315 Invalid, 0 Unknown, 294 Unchecked, 0.3s Time] [2023-02-16 03:42:27,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-16 03:42:27,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2023-02-16 03:42:27,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.523076923076923) internal successors, (99), 94 states have internal predecessors, (99), 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) [2023-02-16 03:42:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2023-02-16 03:42:27,113 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 43 [2023-02-16 03:42:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:27,113 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2023-02-16 03:42:27,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 states have internal predecessors, (73), 4 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:42:27,114 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2023-02-16 03:42:27,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-16 03:42:27,114 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:27,114 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:27,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-16 03:42:27,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-16 03:42:27,321 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:27,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:27,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2097625015, now seen corresponding path program 1 times [2023-02-16 03:42:27,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:27,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640191829] [2023-02-16 03:42:27,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:27,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:27,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:27,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:27,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:42:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-16 03:42:27,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:27,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640191829] [2023-02-16 03:42:27,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640191829] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:27,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:42:27,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:42:27,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516867899] [2023-02-16 03:42:27,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:27,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:42:27,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:27,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:42:27,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:42:27,455 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:42:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:27,616 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2023-02-16 03:42:27,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:42:27,617 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2023-02-16 03:42:27,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:27,617 INFO L225 Difference]: With dead ends: 113 [2023-02-16 03:42:27,617 INFO L226 Difference]: Without dead ends: 113 [2023-02-16 03:42:27,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:42:27,618 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 70 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:27,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 264 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:42:27,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-16 03:42:27,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2023-02-16 03:42:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 90 states have internal predecessors, (95), 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) [2023-02-16 03:42:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2023-02-16 03:42:27,621 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 45 [2023-02-16 03:42:27,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:27,621 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2023-02-16 03:42:27,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:42:27,621 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2023-02-16 03:42:27,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-16 03:42:27,622 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:27,622 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:27,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-16 03:42:27,622 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:27,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:27,622 INFO L85 PathProgramCache]: Analyzing trace with hash -2097625014, now seen corresponding path program 1 times [2023-02-16 03:42:27,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:27,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995219326] [2023-02-16 03:42:27,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:27,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:27,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:27,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:27,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:42:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-16 03:42:27,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:27,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995219326] [2023-02-16 03:42:27,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995219326] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:27,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:42:27,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:42:27,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155571231] [2023-02-16 03:42:27,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:27,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:42:27,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:27,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:42:27,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:42:27,860 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:42:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:28,009 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2023-02-16 03:42:28,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:42:28,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2023-02-16 03:42:28,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:28,010 INFO L225 Difference]: With dead ends: 91 [2023-02-16 03:42:28,010 INFO L226 Difference]: Without dead ends: 91 [2023-02-16 03:42:28,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:42:28,011 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 69 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:28,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 275 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:42:28,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-16 03:42:28,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-16 03:42:28,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.4) internal successors, (91), 86 states have internal predecessors, (91), 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) [2023-02-16 03:42:28,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2023-02-16 03:42:28,013 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 45 [2023-02-16 03:42:28,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:28,013 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2023-02-16 03:42:28,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:42:28,014 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2023-02-16 03:42:28,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 03:42:28,014 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:28,014 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:28,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-16 03:42:28,015 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:28,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:28,015 INFO L85 PathProgramCache]: Analyzing trace with hash -601855080, now seen corresponding path program 1 times [2023-02-16 03:42:28,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:28,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042265333] [2023-02-16 03:42:28,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:28,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:28,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:28,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:28,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:42:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 03:42:28,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:28,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042265333] [2023-02-16 03:42:28,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042265333] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:28,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801957847] [2023-02-16 03:42:28,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:28,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:28,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:28,601 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:42:28,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-16 03:42:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:28,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-16 03:42:28,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:28,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:42:29,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-16 03:42:29,153 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2355 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2355))))) is different from true [2023-02-16 03:42:29,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:29,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 03:42:29,189 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-16 03:42:29,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 03:42:29,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-16 03:42:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-16 03:42:29,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:42:29,314 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2361 (Array Int Int)) (|v_node_create_~temp~0#1.base_52| Int)) (or (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_52| 1) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_52| v_ArrVal_2361) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 1) (not (< |v_node_create_~temp~0#1.base_52| |c_#StackHeapBarrier|)))) is different from false [2023-02-16 03:42:29,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801957847] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:29,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:42:29,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2023-02-16 03:42:29,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798965321] [2023-02-16 03:42:29,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:42:29,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-16 03:42:29,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:29,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-16 03:42:29,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=573, Unknown=3, NotChecked=98, Total=756 [2023-02-16 03:42:29,317 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:42:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:29,991 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2023-02-16 03:42:29,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:42:29,992 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2023-02-16 03:42:29,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:29,992 INFO L225 Difference]: With dead ends: 108 [2023-02-16 03:42:29,992 INFO L226 Difference]: Without dead ends: 108 [2023-02-16 03:42:29,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=952, Unknown=5, NotChecked=130, Total=1260 [2023-02-16 03:42:29,993 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 407 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 12 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:29,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 605 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 853 Invalid, 3 Unknown, 93 Unchecked, 0.5s Time] [2023-02-16 03:42:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-16 03:42:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2023-02-16 03:42:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 85 states have internal predecessors, (90), 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) [2023-02-16 03:42:29,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2023-02-16 03:42:29,996 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 46 [2023-02-16 03:42:29,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:29,996 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2023-02-16 03:42:29,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:42:29,996 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2023-02-16 03:42:29,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 03:42:29,997 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:29,997 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:30,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-16 03:42:30,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-16 03:42:30,198 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:30,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:30,198 INFO L85 PathProgramCache]: Analyzing trace with hash -601855079, now seen corresponding path program 1 times [2023-02-16 03:42:30,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:30,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655690822] [2023-02-16 03:42:30,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:30,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:30,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:30,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:30,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:42:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:42:31,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:31,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655690822] [2023-02-16 03:42:31,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655690822] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:31,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691415942] [2023-02-16 03:42:31,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:31,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:31,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:31,345 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:42:31,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-16 03:42:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:31,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 63 conjunts are in the unsatisfiable core [2023-02-16 03:42:31,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:31,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:42:31,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:42:32,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-16 03:42:32,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-16 03:42:32,191 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2596 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_2596))) (exists ((v_ArrVal_2601 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2601))) (exists ((v_ArrVal_2602 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2602))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-16 03:42:32,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:32,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 03:42:32,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:32,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-16 03:42:32,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:32,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-16 03:42:32,245 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-16 03:42:32,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-16 03:42:32,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-16 03:42:32,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-02-16 03:42:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-16 03:42:32,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:42:32,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691415942] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:32,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:42:32,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2023-02-16 03:42:32,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990641579] [2023-02-16 03:42:32,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:42:32,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-16 03:42:32,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:32,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-16 03:42:32,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=961, Unknown=2, NotChecked=62, Total=1122 [2023-02-16 03:42:32,575 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 31 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:42:33,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:33,965 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2023-02-16 03:42:33,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-16 03:42:33,966 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2023-02-16 03:42:33,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:33,966 INFO L225 Difference]: With dead ends: 89 [2023-02-16 03:42:33,966 INFO L226 Difference]: Without dead ends: 89 [2023-02-16 03:42:33,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=221, Invalid=1758, Unknown=5, NotChecked=86, Total=2070 [2023-02-16 03:42:33,967 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 312 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:33,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 825 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1115 Invalid, 3 Unknown, 92 Unchecked, 0.8s Time] [2023-02-16 03:42:33,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-16 03:42:33,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-02-16 03:42:33,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 84 states have internal predecessors, (89), 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) [2023-02-16 03:42:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2023-02-16 03:42:33,970 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 46 [2023-02-16 03:42:33,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:33,970 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2023-02-16 03:42:33,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:42:33,970 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2023-02-16 03:42:33,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-16 03:42:33,970 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:33,970 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:33,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-16 03:42:34,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:34,177 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:34,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:34,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1437854233, now seen corresponding path program 1 times [2023-02-16 03:42:34,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:34,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417911649] [2023-02-16 03:42:34,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:34,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:34,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:34,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:34,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:42:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:35,598 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:42:35,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:35,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417911649] [2023-02-16 03:42:35,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417911649] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:35,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449906600] [2023-02-16 03:42:35,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:35,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:35,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:35,600 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:42:35,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-16 03:42:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:35,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 86 conjunts are in the unsatisfiable core [2023-02-16 03:42:35,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:35,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:42:36,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:42:36,197 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:42:36,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 14 [2023-02-16 03:42:36,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 03:42:36,378 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2857 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2857))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2856 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2856))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-16 03:42:36,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:36,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:42:36,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:36,432 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:42:36,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2023-02-16 03:42:36,460 INFO L321 Elim1Store]: treesize reduction 92, result has 31.9 percent of original size [2023-02-16 03:42:36,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 57 [2023-02-16 03:42:36,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:42:36,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:42:36,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 25 [2023-02-16 03:42:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-16 03:42:36,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:42:36,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449906600] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:36,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:42:36,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 37 [2023-02-16 03:42:36,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298719356] [2023-02-16 03:42:36,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:42:36,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-16 03:42:36,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:36,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-16 03:42:36,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1429, Unknown=2, NotChecked=76, Total=1640 [2023-02-16 03:42:36,900 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 38 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:42:38,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:38,895 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2023-02-16 03:42:38,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-16 03:42:38,896 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 48 [2023-02-16 03:42:38,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:38,897 INFO L225 Difference]: With dead ends: 147 [2023-02-16 03:42:38,897 INFO L226 Difference]: Without dead ends: 147 [2023-02-16 03:42:38,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=364, Invalid=2716, Unknown=4, NotChecked=108, Total=3192 [2023-02-16 03:42:38,898 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 386 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 1424 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1424 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:38,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1109 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1424 Invalid, 3 Unknown, 155 Unchecked, 1.1s Time] [2023-02-16 03:42:38,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-02-16 03:42:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 88. [2023-02-16 03:42:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.353846153846154) internal successors, (88), 83 states have internal predecessors, (88), 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) [2023-02-16 03:42:38,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2023-02-16 03:42:38,901 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 48 [2023-02-16 03:42:38,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:38,901 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2023-02-16 03:42:38,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:42:38,901 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2023-02-16 03:42:38,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-16 03:42:38,902 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:38,902 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:38,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-16 03:42:39,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:39,108 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:39,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:39,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1437854234, now seen corresponding path program 1 times [2023-02-16 03:42:39,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:39,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853175677] [2023-02-16 03:42:39,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:39,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:40,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:40,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:40,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:42:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:42:41,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:41,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853175677] [2023-02-16 03:42:41,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853175677] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:41,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892385721] [2023-02-16 03:42:41,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:41,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:41,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:41,469 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:42:41,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-16 03:42:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:41,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 84 conjunts are in the unsatisfiable core [2023-02-16 03:42:41,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:41,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:42:42,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:42:42,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:42:42,321 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-16 03:42:42,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 44 [2023-02-16 03:42:42,338 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-02-16 03:42:42,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2023-02-16 03:42:42,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:42:42,349 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:42:42,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:42:42,556 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3111 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3111))) (exists ((v_ArrVal_3106 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3106))) (exists ((v_ArrVal_3112 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3112))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-16 03:42:42,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:42,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2023-02-16 03:42:42,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:42,603 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:42:42,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 83 [2023-02-16 03:42:42,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:42,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:42,613 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 03:42:42,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 71 [2023-02-16 03:42:42,631 INFO L321 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2023-02-16 03:42:42,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2023-02-16 03:42:42,762 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-16 03:42:42,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 50 [2023-02-16 03:42:42,771 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-02-16 03:42:42,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2023-02-16 03:42:42,843 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-16 03:42:42,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:42:43,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892385721] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:43,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:42:43,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 44 [2023-02-16 03:42:43,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036144611] [2023-02-16 03:42:43,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:42:43,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-16 03:42:43,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:43,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-16 03:42:43,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2196, Unknown=2, NotChecked=94, Total=2450 [2023-02-16 03:42:43,179 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 45 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 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) [2023-02-16 03:42:45,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:45,564 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2023-02-16 03:42:45,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-16 03:42:45,565 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 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 48 [2023-02-16 03:42:45,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:45,565 INFO L225 Difference]: With dead ends: 130 [2023-02-16 03:42:45,565 INFO L226 Difference]: Without dead ends: 130 [2023-02-16 03:42:45,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=349, Invalid=3943, Unknown=2, NotChecked=128, Total=4422 [2023-02-16 03:42:45,567 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 228 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 2021 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:45,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1736 Invalid, 2166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2021 Invalid, 0 Unknown, 136 Unchecked, 1.2s Time] [2023-02-16 03:42:45,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-16 03:42:45,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 87. [2023-02-16 03:42:45,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 82 states have internal predecessors, (87), 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) [2023-02-16 03:42:45,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2023-02-16 03:42:45,570 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 48 [2023-02-16 03:42:45,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:45,570 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2023-02-16 03:42:45,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 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) [2023-02-16 03:42:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2023-02-16 03:42:45,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 03:42:45,570 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:45,570 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:45,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-16 03:42:45,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-16 03:42:45,777 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:45,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:45,778 INFO L85 PathProgramCache]: Analyzing trace with hash -2081433199, now seen corresponding path program 1 times [2023-02-16 03:42:45,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:45,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596688089] [2023-02-16 03:42:45,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:45,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:46,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:46,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:46,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:42:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-16 03:42:46,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:46,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596688089] [2023-02-16 03:42:46,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596688089] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:46,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:42:46,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-16 03:42:46,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519687565] [2023-02-16 03:42:46,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:46,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 03:42:46,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:46,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 03:42:46,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:42:46,054 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:42:46,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:46,274 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2023-02-16 03:42:46,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 03:42:46,274 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2023-02-16 03:42:46,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:46,275 INFO L225 Difference]: With dead ends: 150 [2023-02-16 03:42:46,275 INFO L226 Difference]: Without dead ends: 150 [2023-02-16 03:42:46,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-02-16 03:42:46,276 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 179 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:46,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 402 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:42:46,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-16 03:42:46,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 90. [2023-02-16 03:42:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.318840579710145) internal successors, (91), 85 states have internal predecessors, (91), 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) [2023-02-16 03:42:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2023-02-16 03:42:46,278 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 51 [2023-02-16 03:42:46,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:46,279 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2023-02-16 03:42:46,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:42:46,279 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2023-02-16 03:42:46,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 03:42:46,279 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:46,279 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:46,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-16 03:42:46,279 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:46,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:46,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2081433198, now seen corresponding path program 1 times [2023-02-16 03:42:46,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:46,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065306481] [2023-02-16 03:42:46,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:46,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:46,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:46,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:46,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:42:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:46,681 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-16 03:42:46,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:46,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065306481] [2023-02-16 03:42:46,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065306481] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:46,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:42:46,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-16 03:42:46,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397390988] [2023-02-16 03:42:46,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:46,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 03:42:46,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:46,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 03:42:46,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:42:46,683 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:42:46,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:46,903 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2023-02-16 03:42:46,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:42:46,905 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2023-02-16 03:42:46,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:46,906 INFO L225 Difference]: With dead ends: 132 [2023-02-16 03:42:46,906 INFO L226 Difference]: Without dead ends: 132 [2023-02-16 03:42:46,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-02-16 03:42:46,906 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 269 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:46,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 396 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:42:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-02-16 03:42:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 92. [2023-02-16 03:42:46,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 87 states have internal predecessors, (93), 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) [2023-02-16 03:42:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2023-02-16 03:42:46,909 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 51 [2023-02-16 03:42:46,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:46,909 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2023-02-16 03:42:46,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:42:46,909 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2023-02-16 03:42:46,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-16 03:42:46,910 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:46,910 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:46,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-16 03:42:46,910 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:46,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:46,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1197458036, now seen corresponding path program 1 times [2023-02-16 03:42:46,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:46,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504605242] [2023-02-16 03:42:46,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:46,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:47,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:47,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:47,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:42:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:42:47,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:47,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504605242] [2023-02-16 03:42:47,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504605242] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:47,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808690626] [2023-02-16 03:42:47,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:47,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:47,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:47,359 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:42:47,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-16 03:42:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:47,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-16 03:42:47,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:47,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-16 03:42:47,875 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3724 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3724)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2023-02-16 03:42:47,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:47,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-02-16 03:42:47,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-16 03:42:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-16 03:42:47,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:42:48,010 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3729 (Array Int Int)) (|v_node_create_~temp~0#1.base_64| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_64| v_ArrVal_3729) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (<= (+ .cse0 1) 0) (<= 1 .cse0) (not (< |v_node_create_~temp~0#1.base_64| |c_#StackHeapBarrier|))))) is different from false [2023-02-16 03:42:48,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808690626] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:48,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:42:48,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-02-16 03:42:48,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164695420] [2023-02-16 03:42:48,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:42:48,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-16 03:42:48,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:48,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-16 03:42:48,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=571, Unknown=2, NotChecked=98, Total=756 [2023-02-16 03:42:48,013 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 26 states, 24 states have (on average 2.875) internal successors, (69), 22 states have internal predecessors, (69), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:42:48,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:48,394 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2023-02-16 03:42:48,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 03:42:48,394 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.875) internal successors, (69), 22 states have internal predecessors, (69), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 53 [2023-02-16 03:42:48,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:48,395 INFO L225 Difference]: With dead ends: 83 [2023-02-16 03:42:48,395 INFO L226 Difference]: Without dead ends: 83 [2023-02-16 03:42:48,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=901, Unknown=2, NotChecked=126, Total=1190 [2023-02-16 03:42:48,396 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 337 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:48,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 436 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 308 Invalid, 0 Unknown, 85 Unchecked, 0.2s Time] [2023-02-16 03:42:48,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-16 03:42:48,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-02-16 03:42:48,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 78 states have internal predecessors, (82), 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) [2023-02-16 03:42:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2023-02-16 03:42:48,398 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 53 [2023-02-16 03:42:48,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:48,399 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2023-02-16 03:42:48,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.875) internal successors, (69), 22 states have internal predecessors, (69), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:42:48,399 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2023-02-16 03:42:48,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-16 03:42:48,399 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:48,399 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:48,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-16 03:42:48,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-02-16 03:42:48,607 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:48,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:48,607 INFO L85 PathProgramCache]: Analyzing trace with hash -422730206, now seen corresponding path program 1 times [2023-02-16 03:42:48,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:48,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643295444] [2023-02-16 03:42:48,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:48,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:49,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:49,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:49,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:42:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:49,678 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 03:42:49,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:49,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643295444] [2023-02-16 03:42:49,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643295444] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:49,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116498972] [2023-02-16 03:42:49,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:49,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:49,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:49,680 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:42:49,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-16 03:42:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:49,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-16 03:42:49,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:50,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:42:50,214 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-16 03:42:50,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 28 [2023-02-16 03:42:50,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:50,297 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-16 03:42:50,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 32 [2023-02-16 03:42:50,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:42:50,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:50,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 03:42:50,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-16 03:42:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-16 03:42:50,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:42:50,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116498972] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:50,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 03:42:50,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [22] total 32 [2023-02-16 03:42:50,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519712770] [2023-02-16 03:42:50,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:50,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 03:42:50,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:50,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 03:42:50,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2023-02-16 03:42:50,382 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 13 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:42:50,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:50,721 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2023-02-16 03:42:50,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 03:42:50,721 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2023-02-16 03:42:50,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:50,722 INFO L225 Difference]: With dead ends: 100 [2023-02-16 03:42:50,722 INFO L226 Difference]: Without dead ends: 100 [2023-02-16 03:42:50,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=240, Invalid=1566, Unknown=0, NotChecked=0, Total=1806 [2023-02-16 03:42:50,723 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 248 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:50,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 302 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:42:50,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-16 03:42:50,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2023-02-16 03:42:50,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 77 states have internal predecessors, (81), 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) [2023-02-16 03:42:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2023-02-16 03:42:50,725 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 54 [2023-02-16 03:42:50,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:50,725 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2023-02-16 03:42:50,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:42:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2023-02-16 03:42:50,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-16 03:42:50,726 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:50,726 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:50,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-02-16 03:42:50,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:50,936 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:50,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:50,936 INFO L85 PathProgramCache]: Analyzing trace with hash -422730205, now seen corresponding path program 1 times [2023-02-16 03:42:50,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:50,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835298233] [2023-02-16 03:42:50,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:50,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:51,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:51,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:52,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:42:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:42:52,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:52,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835298233] [2023-02-16 03:42:52,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835298233] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:52,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:42:52,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-02-16 03:42:52,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150911956] [2023-02-16 03:42:52,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:52,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-16 03:42:52,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:52,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-16 03:42:52,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2023-02-16 03:42:52,660 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 21 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:42:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:53,351 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2023-02-16 03:42:53,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-16 03:42:53,352 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2023-02-16 03:42:53,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:53,352 INFO L225 Difference]: With dead ends: 81 [2023-02-16 03:42:53,353 INFO L226 Difference]: Without dead ends: 81 [2023-02-16 03:42:53,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2023-02-16 03:42:53,353 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 338 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:53,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 447 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:42:53,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-16 03:42:53,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-02-16 03:42:53,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 76 states have internal predecessors, (80), 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) [2023-02-16 03:42:53,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-02-16 03:42:53,356 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 54 [2023-02-16 03:42:53,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:53,356 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-02-16 03:42:53,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:42:53,357 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-02-16 03:42:53,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-16 03:42:53,357 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:53,357 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:53,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-16 03:42:53,358 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:53,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:53,358 INFO L85 PathProgramCache]: Analyzing trace with hash -755022309, now seen corresponding path program 1 times [2023-02-16 03:42:53,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:53,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190429270] [2023-02-16 03:42:53,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:53,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:54,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:54,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:54,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:42:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:54,763 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:42:54,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:54,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190429270] [2023-02-16 03:42:54,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190429270] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:54,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:42:54,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2023-02-16 03:42:54,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045501504] [2023-02-16 03:42:54,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:54,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-16 03:42:54,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:54,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-16 03:42:54,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2023-02-16 03:42:54,765 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 24 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:42:55,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:55,555 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2023-02-16 03:42:55,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-16 03:42:55,557 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2023-02-16 03:42:55,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:55,558 INFO L225 Difference]: With dead ends: 103 [2023-02-16 03:42:55,558 INFO L226 Difference]: Without dead ends: 103 [2023-02-16 03:42:55,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=232, Invalid=1100, Unknown=0, NotChecked=0, Total=1332 [2023-02-16 03:42:55,559 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 572 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:55,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 470 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:42:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-16 03:42:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2023-02-16 03:42:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 77 states have internal predecessors, (82), 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) [2023-02-16 03:42:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2023-02-16 03:42:55,561 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 59 [2023-02-16 03:42:55,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:55,562 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2023-02-16 03:42:55,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:42:55,562 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2023-02-16 03:42:55,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-16 03:42:55,562 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:55,563 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:55,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-02-16 03:42:55,563 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:42:55,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:55,563 INFO L85 PathProgramCache]: Analyzing trace with hash -755022308, now seen corresponding path program 1 times [2023-02-16 03:42:55,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:55,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627524399] [2023-02-16 03:42:55,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:55,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:57,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:57,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:57,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:42:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:42:58,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:58,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627524399] [2023-02-16 03:42:58,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627524399] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:58,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616260611] [2023-02-16 03:42:58,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:58,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:58,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:58,098 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:42:58,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-16 03:42:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:58,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 128 conjunts are in the unsatisfiable core [2023-02-16 03:42:58,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:58,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:42:58,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:42:58,505 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:42:58,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:42:58,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:42:58,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:42:58,691 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:42:58,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 03:42:59,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-02-16 03:42:59,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:42:59,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 03:42:59,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:42:59,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:59,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-02-16 03:42:59,470 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-16 03:42:59,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 03:42:59,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:59,494 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-16 03:42:59,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-02-16 03:42:59,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:59,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:42:59,747 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-16 03:42:59,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2023-02-16 03:42:59,764 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-16 03:42:59,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-02-16 03:42:59,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:59,928 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-16 03:42:59,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 72 [2023-02-16 03:42:59,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:59,946 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-16 03:42:59,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 83 [2023-02-16 03:42:59,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:43:00,045 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:43:00,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:00,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2023-02-16 03:43:00,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:00,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:43:00,465 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:43:00,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 85 [2023-02-16 03:43:00,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:00,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 03:43:00,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 53 [2023-02-16 03:43:00,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:43:00,777 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:43:00,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:00,928 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4637 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_4637) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4636 (Array Int Int)) (v_ArrVal_4637 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_4637) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_4636) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-16 03:43:00,935 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (forall ((v_ArrVal_4637 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4637) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4636 (Array Int Int)) (v_ArrVal_4637 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4637) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4636) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-02-16 03:43:00,951 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4637 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4634) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4635) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4637) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4636 (Array Int Int)) (v_ArrVal_4637 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4635))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4634) .cse0 v_ArrVal_4637) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_4636) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-02-16 03:43:00,982 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4637 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4634) (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4635) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4637) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4636 (Array Int Int)) (v_ArrVal_4637 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4635))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4634) .cse0 v_ArrVal_4637) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_4636) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-02-16 03:43:01,039 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4637 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4634) (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4635) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4637) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4634 (Array Int Int)) (v_ArrVal_4635 (Array Int Int)) (v_ArrVal_4636 (Array Int Int)) (v_ArrVal_4637 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4635))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4634) .cse0 v_ArrVal_4637) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_4636) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-02-16 03:43:01,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616260611] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:01,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:43:01,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2023-02-16 03:43:01,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178518004] [2023-02-16 03:43:01,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:43:01,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-16 03:43:01,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:01,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-16 03:43:01,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2778, Unknown=7, NotChecked=550, Total=3540 [2023-02-16 03:43:01,382 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 51 states, 48 states have (on average 2.1875) internal successors, (105), 43 states have internal predecessors, (105), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:43:04,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:04,731 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2023-02-16 03:43:04,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-16 03:43:04,732 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 2.1875) internal successors, (105), 43 states have internal predecessors, (105), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2023-02-16 03:43:04,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:04,732 INFO L225 Difference]: With dead ends: 105 [2023-02-16 03:43:04,732 INFO L226 Difference]: Without dead ends: 105 [2023-02-16 03:43:04,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1438 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=614, Invalid=5097, Unknown=9, NotChecked=760, Total=6480 [2023-02-16 03:43:04,734 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 861 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1738 mSolverCounterSat, 30 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1738 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:04,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 821 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1738 Invalid, 2 Unknown, 0 Unchecked, 1.1s Time] [2023-02-16 03:43:04,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-16 03:43:04,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2023-02-16 03:43:04,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 79 states have internal predecessors, (84), 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) [2023-02-16 03:43:04,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2023-02-16 03:43:04,736 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 59 [2023-02-16 03:43:04,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:04,737 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2023-02-16 03:43:04,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 2.1875) internal successors, (105), 43 states have internal predecessors, (105), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:43:04,737 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2023-02-16 03:43:04,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-16 03:43:04,737 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:04,738 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:04,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-16 03:43:04,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-16 03:43:04,945 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:04,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:04,945 INFO L85 PathProgramCache]: Analyzing trace with hash 273036414, now seen corresponding path program 1 times [2023-02-16 03:43:04,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:04,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825008220] [2023-02-16 03:43:04,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:04,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:08,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:08,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:08,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:09,207 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:43:09,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:09,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825008220] [2023-02-16 03:43:09,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825008220] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:09,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353698616] [2023-02-16 03:43:09,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:09,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:09,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:09,210 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:43:09,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-16 03:43:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:09,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 151 conjunts are in the unsatisfiable core [2023-02-16 03:43:09,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:09,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:43:09,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:43:09,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:43:10,038 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:43:10,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 03:43:10,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-16 03:43:10,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:43:10,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:43:10,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:43:10,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:10,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-16 03:43:10,795 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:43:10,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 31 [2023-02-16 03:43:10,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 03:43:10,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:43:10,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 03:43:11,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:11,308 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:43:11,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 66 [2023-02-16 03:43:11,322 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 03:43:11,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-16 03:43:11,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 03:43:11,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:11,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:43:11,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:11,987 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:43:12,013 INFO L321 Elim1Store]: treesize reduction 108, result has 14.3 percent of original size [2023-02-16 03:43:12,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 149 treesize of output 75 [2023-02-16 03:43:12,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-16 03:43:12,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:12,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-16 03:43:12,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:12,174 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-16 03:43:12,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 79 [2023-02-16 03:43:12,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 03:43:12,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:12,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:43:12,353 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-16 03:43:12,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 106 [2023-02-16 03:43:12,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-02-16 03:43:12,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:12,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-16 03:43:12,709 INFO L321 Elim1Store]: treesize reduction 92, result has 22.0 percent of original size [2023-02-16 03:43:12,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 163 treesize of output 94 [2023-02-16 03:43:12,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:12,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2023-02-16 03:43:12,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:12,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-16 03:43:12,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:12,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2023-02-16 03:43:12,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:43:13,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:43:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:43:13,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:14,228 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4963 Int) (v_ArrVal_4961 Int) (v_ArrVal_4964 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| Int) (v_ArrVal_4957 (Array Int Int)) (v_ArrVal_4958 (Array Int Int)) (v_ArrVal_4959 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4959))) (or (= (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4957))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| 4))) (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4958))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_4963))) (select (select (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_4961)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse4 .cse1 v_ArrVal_4964) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) |c_ULTIMATE.start_main_~data~0#1|) (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) is different from false [2023-02-16 03:43:14,271 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4950 (Array Int Int)) (v_ArrVal_4963 Int) (v_ArrVal_4961 Int) (v_ArrVal_4952 (Array Int Int)) (v_ArrVal_4964 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| Int) (v_ArrVal_4957 (Array Int Int)) (v_ArrVal_4958 (Array Int Int)) (v_ArrVal_4959 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4952) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4959))) (or (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4957))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| 4))) (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4950) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4958))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_4963))) (select (select (store .cse4 .cse2 (store (select .cse4 .cse2) .cse3 v_ArrVal_4961)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse0 .cse2 v_ArrVal_4964) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) |c_ULTIMATE.start_main_~data~0#1|)))) is different from false [2023-02-16 03:43:14,289 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4950 (Array Int Int)) (v_ArrVal_4963 Int) (v_ArrVal_4961 Int) (v_ArrVal_4952 (Array Int Int)) (v_ArrVal_4964 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| Int) (v_ArrVal_4957 (Array Int Int)) (v_ArrVal_4958 (Array Int Int)) (v_ArrVal_4959 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_4952) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4959))) (or (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4957))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| 4))) (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_4950) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4958))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_4963))) (select (select (store .cse4 .cse2 (store (select .cse4 .cse2) .cse3 v_ArrVal_4961)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse0 .cse2 v_ArrVal_4964) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) |c_ULTIMATE.start_main_~data~0#1|)))) is different from false [2023-02-16 03:43:14,307 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4950 (Array Int Int)) (v_ArrVal_4963 Int) (v_ArrVal_4961 Int) (v_ArrVal_4952 (Array Int Int)) (v_ArrVal_4964 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| Int) (v_ArrVal_4957 (Array Int Int)) (v_ArrVal_4958 (Array Int Int)) (v_ArrVal_4959 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_4952) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4959))) (or (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= (let ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4957))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| 4))) (select (let ((.cse1 (store (store |c_#memory_int| .cse4 v_ArrVal_4950) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4958))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_4963))) (select (select (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 v_ArrVal_4961)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse0 .cse2 v_ArrVal_4964) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) |c_ULTIMATE.start_main_~data~0#1|))))) is different from false [2023-02-16 03:43:14,328 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4950 (Array Int Int)) (v_ArrVal_4963 Int) (v_ArrVal_4961 Int) (v_ArrVal_4952 (Array Int Int)) (v_ArrVal_4964 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| Int) (v_ArrVal_4957 (Array Int Int)) (v_ArrVal_4958 (Array Int Int)) (v_ArrVal_4959 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_4952) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4959))) (or (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= (let ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4957))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| 4))) (select (let ((.cse1 (store (store |c_#memory_int| .cse4 v_ArrVal_4950) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4958))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_4963))) (select (select (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 v_ArrVal_4961)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse0 .cse2 v_ArrVal_4964) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) |c_ULTIMATE.start_main_~data~0#1|))))) is different from false [2023-02-16 03:43:14,373 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4950 (Array Int Int)) (v_ArrVal_4963 Int) (v_ArrVal_4961 Int) (v_ArrVal_4952 (Array Int Int)) (v_ArrVal_4964 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| Int) (v_ArrVal_4957 (Array Int Int)) (v_ArrVal_4958 (Array Int Int)) (v_ArrVal_4959 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_4952) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4959))) (or (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= (let ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4957))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| 4))) (select (let ((.cse1 (store (store |c_#memory_int| .cse4 v_ArrVal_4950) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4958))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_4963))) (select (select (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 v_ArrVal_4961)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse0 .cse2 v_ArrVal_4964) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) |c_ULTIMATE.start_main_~data~0#1|))))) is different from false [2023-02-16 03:43:14,481 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4963 Int) (v_ArrVal_4961 Int) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| Int) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4950 (Array Int Int)) (v_ArrVal_4952 (Array Int Int)) (v_ArrVal_4964 (Array Int Int)) (v_ArrVal_4977 (Array Int Int)) (v_ArrVal_4978 (Array Int Int)) (v_ArrVal_4979 (Array Int Int)) (v_ArrVal_4957 (Array Int Int)) (v_ArrVal_4958 (Array Int Int)) (v_ArrVal_4959 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_4979)) (.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_4978))) (let ((.cse3 (select (select .cse6 (select (select .cse6 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse5 (store (store .cse7 .cse3 v_ArrVal_4952) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_4959))) (or (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27|))) (= (let ((.cse4 (store (store .cse6 .cse3 (store (select .cse6 .cse3) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27|)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_4957))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| 4))) (select (let ((.cse0 (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_4977) .cse3 v_ArrVal_4950) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_4958))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_4963))) (select (select (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_ArrVal_4961)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse5 .cse1 v_ArrVal_4964) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) |c_ULTIMATE.start_main_~data~0#1|) (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))))) is different from false [2023-02-16 03:43:14,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353698616] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:14,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:43:14,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34] total 70 [2023-02-16 03:43:14,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485433441] [2023-02-16 03:43:14,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:43:14,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-02-16 03:43:14,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:14,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-02-16 03:43:14,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=5227, Unknown=65, NotChecked=1064, Total=6642 [2023-02-16 03:43:14,489 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 70 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 61 states have internal predecessors, (108), 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) [2023-02-16 03:43:18,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:43:25,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 03:43:28,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:28,750 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2023-02-16 03:43:28,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-16 03:43:28,750 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 61 states have internal predecessors, (108), 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 61 [2023-02-16 03:43:28,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:28,751 INFO L225 Difference]: With dead ends: 103 [2023-02-16 03:43:28,751 INFO L226 Difference]: Without dead ends: 103 [2023-02-16 03:43:28,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 107 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2053 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=862, Invalid=9401, Unknown=67, NotChecked=1442, Total=11772 [2023-02-16 03:43:28,753 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 952 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 2454 mSolverCounterSat, 86 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2454 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:28,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 936 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2454 Invalid, 4 Unknown, 0 Unchecked, 6.3s Time] [2023-02-16 03:43:28,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-16 03:43:28,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 84. [2023-02-16 03:43:28,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 79 states have internal predecessors, (83), 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) [2023-02-16 03:43:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2023-02-16 03:43:28,756 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 61 [2023-02-16 03:43:28,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:28,757 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2023-02-16 03:43:28,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 61 states have internal predecessors, (108), 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) [2023-02-16 03:43:28,757 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2023-02-16 03:43:28,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-16 03:43:28,757 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:28,758 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:28,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-16 03:43:28,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-16 03:43:28,965 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:43:28,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:28,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1627638346, now seen corresponding path program 1 times [2023-02-16 03:43:28,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:28,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480958711] [2023-02-16 03:43:28,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:28,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:32,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:32,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:32,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:33,142 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:43:33,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:33,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480958711] [2023-02-16 03:43:33,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480958711] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:33,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168919538] [2023-02-16 03:43:33,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:33,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:33,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:33,145 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:43:33,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-16 03:43:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:33,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 137 conjunts are in the unsatisfiable core [2023-02-16 03:43:33,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:33,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:43:33,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:43:33,658 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:43:33,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 03:43:33,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:43:33,916 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-16 03:43:33,917 INFO L350 Elim1Store]: Elim1 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 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-16 03:43:34,067 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-02-16 03:43:34,172 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:43:34,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 40 [2023-02-16 03:43:34,345 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:43:34,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-02-16 03:43:34,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:34,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2023-02-16 03:43:34,631 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:43:34,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 29 [2023-02-16 03:43:34,635 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-16 03:43:34,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 03:43:35,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:35,047 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:43:35,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 56 [2023-02-16 03:43:35,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:35,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:35,074 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2023-02-16 03:43:35,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 65 [2023-02-16 03:43:35,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:35,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:43:35,684 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2023-02-16 03:43:35,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 149 treesize of output 114 [2023-02-16 03:43:35,701 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:43:35,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 48 [2023-02-16 03:43:35,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:35,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:43:35,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:35,795 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:43:35,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 68 [2023-02-16 03:43:35,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:35,912 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:43:35,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 68 [2023-02-16 03:43:35,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:35,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:43:36,149 INFO L321 Elim1Store]: treesize reduction 62, result has 34.0 percent of original size [2023-02-16 03:43:36,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 79 [2023-02-16 03:43:36,160 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-16 03:43:36,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2023-02-16 03:43:36,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:43:36,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:43:37,263 INFO L321 Elim1Store]: treesize reduction 132, result has 58.6 percent of original size [2023-02-16 03:43:37,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 14 new quantified variables, introduced 55 case distinctions, treesize of input 411 treesize of output 338 [2023-02-16 03:43:53,007 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:43:53,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:53,195 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_ArrVal_5283 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_5283) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2023-02-16 03:43:53,201 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_ArrVal_5283 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5283) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 1)) is different from false [2023-02-16 03:43:53,209 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_ArrVal_5280 (Array Int Int)) (v_ArrVal_5281 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5281))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |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_circular_append_~new_last~0#1.base| v_ArrVal_5280) .cse2 v_ArrVal_5283) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) 1)) is different from false [2023-02-16 03:43:53,859 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| Int) (v_ArrVal_5277 (Array Int Int)) (v_ArrVal_5276 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_ArrVal_5280 (Array Int Int)) (v_ArrVal_5281 (Array Int Int)) (v_ArrVal_5295 (Array Int Int)) (v_ArrVal_5294 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| v_ArrVal_5294)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| v_ArrVal_5295))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| 1)) (.cse5 (select (select .cse6 (select (select .cse6 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (or (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (= (select .cse0 (let ((.cse2 (store (store .cse6 .cse5 v_ArrVal_5277) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| v_ArrVal_5281))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse1 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30|)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store .cse4 .cse5 v_ArrVal_5276) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30| v_ArrVal_5280) .cse3 v_ArrVal_5283) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_30|))) (not (= 1 (select .cse0 .cse5))))))) is different from false [2023-02-16 03:43:53,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168919538] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:53,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:43:53,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 32] total 70 [2023-02-16 03:43:53,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666256371] [2023-02-16 03:43:53,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:43:53,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-02-16 03:43:53,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:53,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-02-16 03:43:53,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=5893, Unknown=6, NotChecked=628, Total=6806 [2023-02-16 03:43:53,865 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 71 states, 66 states have (on average 1.7727272727272727) internal successors, (117), 62 states have internal predecessors, (117), 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) [2023-02-16 03:44:03,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:44:03,162 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2023-02-16 03:44:03,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-16 03:44:03,163 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 66 states have (on average 1.7727272727272727) internal successors, (117), 62 states have internal predecessors, (117), 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 65 [2023-02-16 03:44:03,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:44:03,164 INFO L225 Difference]: With dead ends: 135 [2023-02-16 03:44:03,164 INFO L226 Difference]: Without dead ends: 135 [2023-02-16 03:44:03,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 109 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3234 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=857, Invalid=10495, Unknown=6, NotChecked=852, Total=12210 [2023-02-16 03:44:03,165 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1177 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 2559 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 2631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:44:03,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 999 Invalid, 2631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2559 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-16 03:44:03,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-16 03:44:03,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 88. [2023-02-16 03:44:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.289855072463768) internal successors, (89), 83 states have internal predecessors, (89), 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) [2023-02-16 03:44:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2023-02-16 03:44:03,167 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 65 [2023-02-16 03:44:03,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:44:03,168 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2023-02-16 03:44:03,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 66 states have (on average 1.7727272727272727) internal successors, (117), 62 states have internal predecessors, (117), 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) [2023-02-16 03:44:03,168 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2023-02-16 03:44:03,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-16 03:44:03,168 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:44:03,168 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:44:03,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-16 03:44:03,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:44:03,369 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:44:03,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:44:03,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1627638347, now seen corresponding path program 1 times [2023-02-16 03:44:03,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:44:03,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344378344] [2023-02-16 03:44:03,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:44:03,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:44:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:07,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:44:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:08,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:44:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:08,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:44:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:09,175 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:44:09,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:44:09,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344378344] [2023-02-16 03:44:09,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344378344] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:44:09,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850726278] [2023-02-16 03:44:09,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:44:09,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:44:09,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:44:09,177 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:44:09,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-16 03:44:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:09,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 185 conjunts are in the unsatisfiable core [2023-02-16 03:44:09,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:44:09,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:44:09,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:44:09,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:44:09,783 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:44:09,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 03:44:09,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:44:09,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:44:10,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:10,175 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:44:10,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-02-16 03:44:10,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:44:10,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:44:10,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:44:10,545 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:44:10,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 55 [2023-02-16 03:44:10,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 03:44:10,817 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:44:10,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:44:10,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:44:10,834 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:44:10,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 42 [2023-02-16 03:44:10,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:10,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 35 [2023-02-16 03:44:10,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:10,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-16 03:44:11,274 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:44:11,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 45 [2023-02-16 03:44:11,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:11,279 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-16 03:44:11,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:11,284 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:44:11,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:44:11,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:11,712 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-16 03:44:11,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 81 [2023-02-16 03:44:11,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:11,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:11,727 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-02-16 03:44:11,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2023-02-16 03:44:11,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:11,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:11,750 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 03:44:11,751 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-16 03:44:11,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 29 [2023-02-16 03:44:12,563 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2023-02-16 03:44:12,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 150 treesize of output 117 [2023-02-16 03:44:12,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:12,593 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-16 03:44:12,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 45 [2023-02-16 03:44:12,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:12,695 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:44:12,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 84 [2023-02-16 03:44:12,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:12,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:12,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-16 03:44:12,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:12,777 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:44:12,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 84 [2023-02-16 03:44:12,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:12,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:12,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-16 03:44:13,063 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:44:13,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:13,066 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:44:13,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 96 [2023-02-16 03:44:13,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:13,081 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-02-16 03:44:13,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 132 [2023-02-16 03:44:13,573 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2023-02-16 03:44:13,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 174 treesize of output 76 [2023-02-16 03:44:13,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:13,830 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2023-02-16 03:44:13,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 19 [2023-02-16 03:44:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:44:13,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:44:26,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850726278] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:44:26,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:44:26,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 34] total 71 [2023-02-16 03:44:26,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890175311] [2023-02-16 03:44:26,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:44:26,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-02-16 03:44:26,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:44:26,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-02-16 03:44:26,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=7099, Unknown=47, NotChecked=0, Total=7482 [2023-02-16 03:44:26,815 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 72 states, 67 states have (on average 1.6865671641791045) internal successors, (113), 62 states have internal predecessors, (113), 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) [2023-02-16 03:44:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:44:36,449 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2023-02-16 03:44:36,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-16 03:44:36,450 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 67 states have (on average 1.6865671641791045) internal successors, (113), 62 states have internal predecessors, (113), 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 65 [2023-02-16 03:44:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:44:36,450 INFO L225 Difference]: With dead ends: 157 [2023-02-16 03:44:36,450 INFO L226 Difference]: Without dead ends: 157 [2023-02-16 03:44:36,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 41 SyntacticMatches, 9 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3270 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=908, Invalid=12155, Unknown=47, NotChecked=0, Total=13110 [2023-02-16 03:44:36,451 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 999 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 2355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:44:36,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 923 Invalid, 2355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-02-16 03:44:36,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-16 03:44:36,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 90. [2023-02-16 03:44:36,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 85 states have internal predecessors, (91), 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) [2023-02-16 03:44:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2023-02-16 03:44:36,454 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 65 [2023-02-16 03:44:36,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:44:36,454 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2023-02-16 03:44:36,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 67 states have (on average 1.6865671641791045) internal successors, (113), 62 states have internal predecessors, (113), 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) [2023-02-16 03:44:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2023-02-16 03:44:36,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-16 03:44:36,455 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:44:36,455 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:44:36,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-16 03:44:36,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:44:36,657 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:44:36,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:44:36,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1082819804, now seen corresponding path program 1 times [2023-02-16 03:44:36,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:44:36,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200379644] [2023-02-16 03:44:36,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:44:36,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:44:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:38,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:44:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:38,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:44:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:39,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:44:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:44:39,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:44:39,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200379644] [2023-02-16 03:44:39,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200379644] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:44:39,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013545571] [2023-02-16 03:44:39,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:44:39,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:44:39,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:44:39,512 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:44:39,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-16 03:44:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:39,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 145 conjunts are in the unsatisfiable core [2023-02-16 03:44:39,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:44:39,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:44:39,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:44:40,070 WARN L837 $PredicateComparison]: unable to prove that (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |c_#valid| .cse0))) |c_#valid|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from false [2023-02-16 03:44:40,072 WARN L859 $PredicateComparison]: unable to prove that (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |c_#valid| .cse0))) |c_#valid|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from true [2023-02-16 03:44:40,087 WARN L837 $PredicateComparison]: unable to prove that (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |c_#valid| .cse0))) |c_#valid|))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from false [2023-02-16 03:44:40,088 WARN L859 $PredicateComparison]: unable to prove that (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |c_#valid| .cse0))) |c_#valid|))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from true [2023-02-16 03:44:40,159 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= |c_#valid| |c_old(#valid)|)) is different from false [2023-02-16 03:44:40,161 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= |c_#valid| |c_old(#valid)|)) is different from true [2023-02-16 03:44:40,185 WARN L837 $PredicateComparison]: unable to prove that (and (= 0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= 0 |c_node_create_~temp~0#1.offset|) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from false [2023-02-16 03:44:40,187 WARN L859 $PredicateComparison]: unable to prove that (and (= 0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= 0 |c_node_create_~temp~0#1.offset|) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2023-02-16 03:44:40,280 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= 0 (select |c_old(#valid)| |c_node_create_#res#1.base|))) is different from false [2023-02-16 03:44:40,283 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= 0 (select |c_old(#valid)| |c_node_create_#res#1.base|))) is different from true [2023-02-16 03:44:40,349 WARN L837 $PredicateComparison]: unable to prove that (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_45| .cse0))) |v_#valid_BEFORE_CALL_45|) (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from false [2023-02-16 03:44:40,352 WARN L859 $PredicateComparison]: unable to prove that (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_45| .cse0))) |v_#valid_BEFORE_CALL_45|) (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from true [2023-02-16 03:44:40,397 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_45| .cse0))) |v_#valid_BEFORE_CALL_45|) (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from false [2023-02-16 03:44:40,399 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_45| .cse0))) |v_#valid_BEFORE_CALL_45|) (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from true [2023-02-16 03:44:40,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:44:40,453 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_45| .cse0))) |v_#valid_BEFORE_CALL_45|) (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from false [2023-02-16 03:44:40,456 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_45| .cse0))) |v_#valid_BEFORE_CALL_45|) (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from true [2023-02-16 03:44:40,516 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:44:40,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-02-16 03:44:40,560 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_45| .cse1))) |v_#valid_BEFORE_CALL_45|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_50| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))))) is different from false [2023-02-16 03:44:40,564 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_45| .cse1))) |v_#valid_BEFORE_CALL_45|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_50| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))))) is different from true [2023-02-16 03:44:40,612 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_45| .cse1))) |v_#valid_BEFORE_CALL_45|))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))))) is different from false [2023-02-16 03:44:40,615 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_45| .cse1))) |v_#valid_BEFORE_CALL_45|))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))))) is different from true [2023-02-16 03:44:40,671 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:44:40,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2023-02-16 03:44:40,713 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_45| .cse1))) |v_#valid_BEFORE_CALL_45|))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))))) is different from false [2023-02-16 03:44:40,716 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_45| .cse1))) |v_#valid_BEFORE_CALL_45|))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))))) is different from true [2023-02-16 03:44:40,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:40,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-02-16 03:44:40,769 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_45| .cse1))) |v_#valid_BEFORE_CALL_45|))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select .cse2 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) .cse0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))))) is different from false [2023-02-16 03:44:40,773 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_45| .cse1))) |v_#valid_BEFORE_CALL_45|))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select .cse2 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) .cse0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))))) is different from true [2023-02-16 03:44:40,822 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse1 (select .cse0 0))) (and (= (select .cse0 4) .cse1) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_45| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_50| .cse1) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse2 (select |v_#valid_BEFORE_CALL_45| .cse2))) |v_#valid_BEFORE_CALL_45|) (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))))) is different from false [2023-02-16 03:44:40,825 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse1 (select .cse0 0))) (and (= (select .cse0 4) .cse1) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_45| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_50| .cse1) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse2 (select |v_#valid_BEFORE_CALL_45| .cse2))) |v_#valid_BEFORE_CALL_45|) (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))))) is different from true [2023-02-16 03:44:40,878 WARN L837 $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 ((.cse3 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse3 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| .cse0)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| .cse0 1)) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_45| .cse1))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_45| .cse2) 1))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse0 |c_#StackHeapBarrier|) (= (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_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse3 4) .cse2) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))))))) is different from false [2023-02-16 03:44:40,881 WARN L859 $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 ((.cse3 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse3 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| .cse0)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| .cse0 1)) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_45| .cse1))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_45| .cse2) 1))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (< .cse0 |c_#StackHeapBarrier|) (= (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_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse3 4) .cse2) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))))))) is different from true [2023-02-16 03:44:40,907 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:44:40,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 25 [2023-02-16 03:44:40,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 03:44:40,940 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_45| .cse0))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from false [2023-02-16 03:44:40,943 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_45| .cse0))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from true [2023-02-16 03:44:40,994 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= 0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_45| .cse0))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from false [2023-02-16 03:44:40,997 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= 0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_45| .cse0))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from true [2023-02-16 03:44:41,092 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5910 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5910))) (exists ((v_ArrVal_5911 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5911))) (= 0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)) (= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_45| .cse0))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from false [2023-02-16 03:44:41,095 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5910 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5910))) (exists ((v_ArrVal_5911 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5911))) (= 0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)) (= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_45| .cse0))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from true [2023-02-16 03:44:41,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-16 03:44:41,149 WARN L837 $PredicateComparison]: unable to prove that (and (= 0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)) (= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_45| .cse0))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (exists ((v_arrayElimArr_1 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_arrayElimArr_1)) (= (select v_arrayElimArr_1 (+ |c_node_create_~temp~0#1.offset| 4)) 0))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5912 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5912))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from false [2023-02-16 03:44:41,152 WARN L859 $PredicateComparison]: unable to prove that (and (= 0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)) (= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_45| .cse0))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (exists ((v_arrayElimArr_1 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_arrayElimArr_1)) (= (select v_arrayElimArr_1 (+ |c_node_create_~temp~0#1.offset| 4)) 0))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5912 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5912))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from true [2023-02-16 03:44:41,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 20 [2023-02-16 03:44:41,211 WARN L837 $PredicateComparison]: unable to prove that (and (= 0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_45| .cse0))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (exists ((v_ArrVal_5915 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5915))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_arrayElimArr_2 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_arrayElimArr_2)) (= (select v_arrayElimArr_2 4) 0))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from false [2023-02-16 03:44:41,214 WARN L859 $PredicateComparison]: unable to prove that (and (= 0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_45| .cse0))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (exists ((v_ArrVal_5915 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5915))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_arrayElimArr_2 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_arrayElimArr_2)) (= (select v_arrayElimArr_2 4) 0))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from true [2023-02-16 03:44:41,264 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5915 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_5915))) (exists ((v_arrayElimArr_2 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_arrayElimArr_2)) (= (select v_arrayElimArr_2 4) 0))) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_45| .cse0))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (= 0 (select |c_old(#valid)| |c_node_create_#res#1.base|)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from false [2023-02-16 03:44:41,267 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5915 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_5915))) (exists ((v_arrayElimArr_2 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_arrayElimArr_2)) (= (select v_arrayElimArr_2 4) 0))) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_45| .cse0))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (= 0 (select |c_old(#valid)| |c_node_create_#res#1.base|)) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from true [2023-02-16 03:44:41,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:41,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:44:41,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:41,360 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:44:41,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 80 [2023-02-16 03:44:41,503 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse4 (+ .cse5 2)) (.cse6 (select .cse8 0))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse1 (+ v_arrayElimIndex_49 2))) (and (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse3 (select |v_#valid_BEFORE_CALL_45| .cse3))) |v_#valid_BEFORE_CALL_45|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse6) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse5 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse7 (select |v_#valid_BEFORE_CALL_48| .cse7))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse6) 1))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse8 4) .cse6))))) is different from false [2023-02-16 03:44:41,507 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse4 (+ .cse5 2)) (.cse6 (select .cse8 0))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse1 (+ v_arrayElimIndex_49 2))) (and (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse3 (select |v_#valid_BEFORE_CALL_45| .cse3))) |v_#valid_BEFORE_CALL_45|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse6) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse5 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse7 (select |v_#valid_BEFORE_CALL_48| .cse7))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse6) 1))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse8 4) .cse6))))) is different from true [2023-02-16 03:44:41,674 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse7 (+ .cse1 2)) (.cse2 (select .cse8 0))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse3 (select |v_#valid_BEFORE_CALL_48| .cse3))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse4 (+ v_arrayElimIndex_49 2))) (and (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6))) |v_#valid_BEFORE_CALL_45|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse8 4) .cse2))))) is different from false [2023-02-16 03:44:41,679 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse7 (+ .cse1 2)) (.cse2 (select .cse8 0))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse3 (select |v_#valid_BEFORE_CALL_48| .cse3))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse4 (+ v_arrayElimIndex_49 2))) (and (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6))) |v_#valid_BEFORE_CALL_45|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse8 4) .cse2))))) is different from true [2023-02-16 03:44:41,857 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse7 (+ .cse1 2)) (.cse2 (select .cse8 0))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse3 (select |v_#valid_BEFORE_CALL_48| .cse3))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse4 (+ v_arrayElimIndex_49 2))) (and (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6))) |v_#valid_BEFORE_CALL_45|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse8 4) .cse2))))) is different from false [2023-02-16 03:44:41,862 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse7 (+ .cse1 2)) (.cse2 (select .cse8 0))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse3 (select |v_#valid_BEFORE_CALL_48| .cse3))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse4 (+ v_arrayElimIndex_49 2))) (and (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6))) |v_#valid_BEFORE_CALL_45|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse8 4) .cse2))))) is different from true [2023-02-16 03:44:42,247 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse2 (select .cse5 0)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse1 2))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse3 (select |v_#valid_BEFORE_CALL_48| .cse3))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse2) 1))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse5 4) .cse2) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse6 (+ v_arrayElimIndex_49 2))) (and (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_45| .cse8))) |v_#valid_BEFORE_CALL_45|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) is different from false [2023-02-16 03:44:42,251 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse2 (select .cse5 0)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse1 2))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse3 (select |v_#valid_BEFORE_CALL_48| .cse3))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse2) 1))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse5 4) .cse2) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse6 (+ v_arrayElimIndex_49 2))) (and (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_45| .cse8))) |v_#valid_BEFORE_CALL_45|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) is different from true [2023-02-16 03:44:42,456 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse7 (+ .cse1 2)) (.cse2 (select .cse8 0))) (and (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse3 (select |v_#valid_BEFORE_CALL_48| .cse3))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse4 (+ v_arrayElimIndex_49 2))) (and (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6))) |v_#valid_BEFORE_CALL_45|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse8 4) .cse2))))) is different from false [2023-02-16 03:44:42,461 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse7 (+ .cse1 2)) (.cse2 (select .cse8 0))) (and (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse3 (select |v_#valid_BEFORE_CALL_48| .cse3))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse4 (+ v_arrayElimIndex_49 2))) (and (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6))) |v_#valid_BEFORE_CALL_45|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse8 4) .cse2))))) is different from true [2023-02-16 03:44:42,616 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse7 (+ .cse1 2)) (.cse2 (select .cse8 0))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse3 (select |v_#valid_BEFORE_CALL_48| .cse3))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse4 (+ v_arrayElimIndex_49 2))) (and (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6))) |v_#valid_BEFORE_CALL_45|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (= (select .cse8 4) .cse2))))) is different from false [2023-02-16 03:44:42,621 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse7 (+ .cse1 2)) (.cse2 (select .cse8 0))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse3 (select |v_#valid_BEFORE_CALL_48| .cse3))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse4 (+ v_arrayElimIndex_49 2))) (and (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6))) |v_#valid_BEFORE_CALL_45|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (= (select .cse8 4) .cse2))))) is different from true [2023-02-16 03:44:42,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:42,696 INFO L321 Elim1Store]: treesize reduction 98, result has 16.2 percent of original size [2023-02-16 03:44:42,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 141 treesize of output 123 [2023-02-16 03:44:42,801 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:44:42,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2023-02-16 03:44:42,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-02-16 03:44:42,868 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse8 (+ .cse2 2)) (.cse1 (select .cse9 4)) (.cse3 (select .cse9 0))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (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.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse3) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse5 (+ v_arrayElimIndex_49 2))) (and (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse7 (select |v_#valid_BEFORE_CALL_45| .cse7))) |v_#valid_BEFORE_CALL_45|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse1 .cse3))))) is different from false [2023-02-16 03:44:42,873 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse8 (+ .cse2 2)) (.cse1 (select .cse9 4)) (.cse3 (select .cse9 0))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (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.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse3) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse5 (+ v_arrayElimIndex_49 2))) (and (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse7 (select |v_#valid_BEFORE_CALL_45| .cse7))) |v_#valid_BEFORE_CALL_45|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse1 .cse3))))) is different from true [2023-02-16 03:44:42,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:42,916 INFO L321 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2023-02-16 03:44:42,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 98 [2023-02-16 03:44:42,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:42,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-16 03:44:43,105 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse8 (+ .cse2 2)) (.cse1 (select .cse9 4)) (.cse3 (select .cse9 0))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (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.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse3) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse5 (+ v_arrayElimIndex_49 2))) (and (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse7 (select |v_#valid_BEFORE_CALL_45| .cse7))) |v_#valid_BEFORE_CALL_45|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse1 .cse3))))) is different from false [2023-02-16 03:44:43,110 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse8 (+ .cse2 2)) (.cse1 (select .cse9 4)) (.cse3 (select .cse9 0))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (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.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse3) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse5 (+ v_arrayElimIndex_49 2))) (and (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse7 (select |v_#valid_BEFORE_CALL_45| .cse7))) |v_#valid_BEFORE_CALL_45|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse1 .cse3))))) is different from true [2023-02-16 03:44:43,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:43,285 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:44:43,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 93 [2023-02-16 03:44:43,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:43,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-16 03:44:43,481 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse8 (+ .cse2 2)) (.cse1 (select .cse9 4)) (.cse3 (select .cse9 0))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (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.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse3) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse5 (+ v_arrayElimIndex_49 2))) (and (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse7 (select |v_#valid_BEFORE_CALL_45| .cse7))) |v_#valid_BEFORE_CALL_45|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse1 .cse3))))) is different from false [2023-02-16 03:44:43,485 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse8 (+ .cse2 2)) (.cse1 (select .cse9 4)) (.cse3 (select .cse9 0))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (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.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse3) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse5 (+ v_arrayElimIndex_49 2))) (and (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse7 (select |v_#valid_BEFORE_CALL_45| .cse7))) |v_#valid_BEFORE_CALL_45|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse1 .cse3))))) is different from true [2023-02-16 03:44:43,838 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse8 (+ .cse2 2)) (.cse1 (select .cse9 4)) (.cse3 (select .cse9 0))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (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.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse3) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse5 (+ v_arrayElimIndex_49 2))) (and (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse7 (select |v_#valid_BEFORE_CALL_45| .cse7))) |v_#valid_BEFORE_CALL_45|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse2) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse1 .cse3))))) is different from false [2023-02-16 03:44:43,843 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse8 (+ .cse2 2)) (.cse1 (select .cse9 4)) (.cse3 (select .cse9 0))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (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.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse3) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse5 (+ v_arrayElimIndex_49 2))) (and (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse6 (select |v_#valid_BEFORE_CALL_44| .cse6))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse7 (select |v_#valid_BEFORE_CALL_45| .cse7))) |v_#valid_BEFORE_CALL_45|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse2) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse1 .cse3))))) is different from true [2023-02-16 03:44:43,924 INFO L321 Elim1Store]: treesize reduction 62, result has 34.0 percent of original size [2023-02-16 03:44:43,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 102 [2023-02-16 03:44:43,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:43,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-16 03:44:49,295 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (+ .cse3 2))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse2 (select .cse21 4)) (.cse5 (select .cse21 0)) (.cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) (or (let ((.cse0 (+ .cse5 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_48| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse3 1) .cse5)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse6 (+ v_arrayElimIndex_49 2))) (and (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_45| .cse8))) |v_#valid_BEFORE_CALL_45|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))) (and (or (let ((.cse11 (+ .cse2 2))) (and (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse5) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse3 1) .cse2)) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse10 (select |v_#valid_BEFORE_CALL_48| .cse10))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1))) (<= .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse12 (+ v_arrayElimIndex_49 2))) (and (<= .cse12 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse13 (select |v_#valid_BEFORE_CALL_44| .cse13))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse14 (select |v_#valid_BEFORE_CALL_45| .cse14))) |v_#valid_BEFORE_CALL_45|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse11 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse11 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse12 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_267 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimIndex_49 Int)) (let ((.cse19 (select .cse21 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimIndex_49 2)) (.cse16 (+ .cse19 2))) (and (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse16 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse17 (select |v_#valid_BEFORE_CALL_44| .cse17))) |v_#valid_BEFORE_CALL_44|) (<= .cse16 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse18 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse18 (select |v_#valid_BEFORE_CALL_45| .cse18))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse3)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse3 1) .cse19)) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse20 (select |v_#valid_BEFORE_CALL_48| .cse20))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse5) 0) (<= .cse15 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse5))) .cse1)))) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-16 03:44:49,305 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (+ .cse3 2))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse2 (select .cse21 4)) (.cse5 (select .cse21 0)) (.cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) (or (let ((.cse0 (+ .cse5 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_48| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse3 1) .cse5)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse6 (+ v_arrayElimIndex_49 2))) (and (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_45| .cse8))) |v_#valid_BEFORE_CALL_45|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))) (and (or (let ((.cse11 (+ .cse2 2))) (and (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse5) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse3 1) .cse2)) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse10 (select |v_#valid_BEFORE_CALL_48| .cse10))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1))) (<= .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse12 (+ v_arrayElimIndex_49 2))) (and (<= .cse12 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse13 (select |v_#valid_BEFORE_CALL_44| .cse13))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse14 (select |v_#valid_BEFORE_CALL_45| .cse14))) |v_#valid_BEFORE_CALL_45|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse11 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse11 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse12 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_267 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimIndex_49 Int)) (let ((.cse19 (select .cse21 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimIndex_49 2)) (.cse16 (+ .cse19 2))) (and (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse16 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse17 (select |v_#valid_BEFORE_CALL_44| .cse17))) |v_#valid_BEFORE_CALL_44|) (<= .cse16 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse18 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse18 (select |v_#valid_BEFORE_CALL_45| .cse18))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse3)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse3 1) .cse19)) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse20 (select |v_#valid_BEFORE_CALL_48| .cse20))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse5) 0) (<= .cse15 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse5))) .cse1)))) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-16 03:44:50,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 688 treesize of output 676 [2023-02-16 03:44:52,938 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (+ .cse3 2))) (and (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse1 (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0)) (.cse2 (select .cse21 4)) (.cse5 (select .cse21 0))) (or (let ((.cse0 (+ .cse5 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_48| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse3 1) .cse5)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse6 (+ v_arrayElimIndex_49 2))) (and (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_45| .cse8))) |v_#valid_BEFORE_CALL_45|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))) (and .cse1 (or (let ((.cse12 (+ .cse2 2))) (and (exists ((v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_140 Int) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse10 (+ v_prenex_140 2))) (and (not (= 0 v_prenex_132)) (= (select v_prenex_136 v_prenex_139) 1) (<= .cse10 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (<= .cse9 v_prenex_132) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse11 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse11 (select v_prenex_138 .cse11))) v_prenex_138) (<= .cse12 v_prenex_137) (not (= 0 v_prenex_137)) (= (let ((.cse13 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse13 (select v_prenex_136 .cse13))) v_prenex_136) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse10 v_prenex_137) (<= .cse12 v_prenex_132) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_131 v_prenex_139) 0) (= (select v_prenex_133 v_prenex_132) 1) (<= .cse9 v_prenex_137) (= (select v_prenex_133 v_prenex_134) 0)))) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_135 (Array Int Int))) (and (= 0 (select v_prenex_141 .cse3)) (= (select v_prenex_141 .cse5) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse14 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse14 (select v_prenex_141 .cse14))) v_prenex_141) (= (select v_prenex_135 .cse5) 0) (= 0 (select (store v_prenex_141 .cse3 1) .cse2)))) (<= .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_prenex_150 (Array Int Int)) (v_prenex_151 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_144 (Array Int Int)) (v_prenex_145 (Array Int Int)) (v_prenex_147 (Array Int Int)) (v_prenex_149 (Array Int Int)) (v_prenex_148 Int) (v_prenex_146 Int) (v_prenex_143 Int) (v_prenex_152 Int) (v_prenex_142 Int)) (let ((.cse19 (select .cse21 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse16 (+ v_prenex_152 2)) (.cse15 (+ .cse19 2))) (and (<= .cse15 v_prenex_146) (= 0 (select v_prenex_150 v_prenex_152)) (= (select v_prenex_144 .cse5) 1) (<= .cse9 v_prenex_146) (= (select v_prenex_151 v_prenex_148) 1) (<= .cse16 v_prenex_142) (not (= 0 v_prenex_146)) (<= .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse15 v_prenex_142) (= (let ((.cse17 (@diff v_prenex_147 v_prenex_151))) (store v_prenex_147 .cse17 (select v_prenex_151 .cse17))) v_prenex_151) (<= .cse9 v_prenex_142) (= 0 (select v_prenex_144 .cse3)) (= (let ((.cse18 (@diff v_prenex_149 v_prenex_144))) (store v_prenex_149 .cse18 (select v_prenex_144 .cse18))) v_prenex_144) (= (select v_prenex_145 v_prenex_143) 0) (= (select v_prenex_150 v_prenex_143) 1) (not (= 0 v_prenex_142)) (= (select v_prenex_149 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_149 .cse5) 0) (= (select v_prenex_145 v_prenex_142) 1) (<= .cse16 v_prenex_146) (<= .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select (store v_prenex_144 .cse3 1) .cse19)) (= (select v_prenex_147 v_prenex_148) 0) (= (select v_prenex_147 v_prenex_146) 1) (= (let ((.cse20 (@diff v_prenex_145 v_prenex_150))) (store v_prenex_145 .cse20 (select v_prenex_150 .cse20))) v_prenex_150))))) (= .cse2 .cse5))))))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse3) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-16 03:44:52,949 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (+ .cse3 2))) (and (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse1 (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0)) (.cse2 (select .cse21 4)) (.cse5 (select .cse21 0))) (or (let ((.cse0 (+ .cse5 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_48| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse3 1) .cse5)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse6 (+ v_arrayElimIndex_49 2))) (and (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_45| .cse8))) |v_#valid_BEFORE_CALL_45|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))) (and .cse1 (or (let ((.cse12 (+ .cse2 2))) (and (exists ((v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_140 Int) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse10 (+ v_prenex_140 2))) (and (not (= 0 v_prenex_132)) (= (select v_prenex_136 v_prenex_139) 1) (<= .cse10 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (<= .cse9 v_prenex_132) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse11 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse11 (select v_prenex_138 .cse11))) v_prenex_138) (<= .cse12 v_prenex_137) (not (= 0 v_prenex_137)) (= (let ((.cse13 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse13 (select v_prenex_136 .cse13))) v_prenex_136) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse10 v_prenex_137) (<= .cse12 v_prenex_132) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_131 v_prenex_139) 0) (= (select v_prenex_133 v_prenex_132) 1) (<= .cse9 v_prenex_137) (= (select v_prenex_133 v_prenex_134) 0)))) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_135 (Array Int Int))) (and (= 0 (select v_prenex_141 .cse3)) (= (select v_prenex_141 .cse5) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse14 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse14 (select v_prenex_141 .cse14))) v_prenex_141) (= (select v_prenex_135 .cse5) 0) (= 0 (select (store v_prenex_141 .cse3 1) .cse2)))) (<= .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_prenex_150 (Array Int Int)) (v_prenex_151 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_144 (Array Int Int)) (v_prenex_145 (Array Int Int)) (v_prenex_147 (Array Int Int)) (v_prenex_149 (Array Int Int)) (v_prenex_148 Int) (v_prenex_146 Int) (v_prenex_143 Int) (v_prenex_152 Int) (v_prenex_142 Int)) (let ((.cse19 (select .cse21 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse16 (+ v_prenex_152 2)) (.cse15 (+ .cse19 2))) (and (<= .cse15 v_prenex_146) (= 0 (select v_prenex_150 v_prenex_152)) (= (select v_prenex_144 .cse5) 1) (<= .cse9 v_prenex_146) (= (select v_prenex_151 v_prenex_148) 1) (<= .cse16 v_prenex_142) (not (= 0 v_prenex_146)) (<= .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse15 v_prenex_142) (= (let ((.cse17 (@diff v_prenex_147 v_prenex_151))) (store v_prenex_147 .cse17 (select v_prenex_151 .cse17))) v_prenex_151) (<= .cse9 v_prenex_142) (= 0 (select v_prenex_144 .cse3)) (= (let ((.cse18 (@diff v_prenex_149 v_prenex_144))) (store v_prenex_149 .cse18 (select v_prenex_144 .cse18))) v_prenex_144) (= (select v_prenex_145 v_prenex_143) 0) (= (select v_prenex_150 v_prenex_143) 1) (not (= 0 v_prenex_142)) (= (select v_prenex_149 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_149 .cse5) 0) (= (select v_prenex_145 v_prenex_142) 1) (<= .cse16 v_prenex_146) (<= .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select (store v_prenex_144 .cse3 1) .cse19)) (= (select v_prenex_147 v_prenex_148) 0) (= (select v_prenex_147 v_prenex_146) 1) (= (let ((.cse20 (@diff v_prenex_145 v_prenex_150))) (store v_prenex_145 .cse20 (select v_prenex_150 .cse20))) v_prenex_150))))) (= .cse2 .cse5))))))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse3) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-16 03:44:55,292 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (+ .cse3 2))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse1 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0)) (.cse2 (select .cse21 4)) (.cse5 (select .cse21 0))) (or (let ((.cse0 (+ .cse5 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_48| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse3 1) .cse5)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse6 (+ v_arrayElimIndex_49 2))) (and (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_45| .cse8))) |v_#valid_BEFORE_CALL_45|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))) (and .cse1 (or (let ((.cse12 (+ .cse2 2))) (and (exists ((v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_140 Int) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse10 (+ v_prenex_140 2))) (and (not (= 0 v_prenex_132)) (= (select v_prenex_136 v_prenex_139) 1) (<= .cse10 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (<= .cse9 v_prenex_132) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse11 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse11 (select v_prenex_138 .cse11))) v_prenex_138) (<= .cse12 v_prenex_137) (not (= 0 v_prenex_137)) (= (let ((.cse13 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse13 (select v_prenex_136 .cse13))) v_prenex_136) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse10 v_prenex_137) (<= .cse12 v_prenex_132) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_131 v_prenex_139) 0) (= (select v_prenex_133 v_prenex_132) 1) (<= .cse9 v_prenex_137) (= (select v_prenex_133 v_prenex_134) 0)))) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_135 (Array Int Int))) (and (= 0 (select v_prenex_141 .cse3)) (= (select v_prenex_141 .cse5) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse14 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse14 (select v_prenex_141 .cse14))) v_prenex_141) (= (select v_prenex_135 .cse5) 0) (= 0 (select (store v_prenex_141 .cse3 1) .cse2)))) (<= .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_prenex_150 (Array Int Int)) (v_prenex_151 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_144 (Array Int Int)) (v_prenex_145 (Array Int Int)) (v_prenex_147 (Array Int Int)) (v_prenex_149 (Array Int Int)) (v_prenex_148 Int) (v_prenex_146 Int) (v_prenex_143 Int) (v_prenex_152 Int) (v_prenex_142 Int)) (let ((.cse19 (select .cse21 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse16 (+ v_prenex_152 2)) (.cse15 (+ .cse19 2))) (and (<= .cse15 v_prenex_146) (= 0 (select v_prenex_150 v_prenex_152)) (= (select v_prenex_144 .cse5) 1) (<= .cse9 v_prenex_146) (= (select v_prenex_151 v_prenex_148) 1) (<= .cse16 v_prenex_142) (not (= 0 v_prenex_146)) (<= .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse15 v_prenex_142) (= (let ((.cse17 (@diff v_prenex_147 v_prenex_151))) (store v_prenex_147 .cse17 (select v_prenex_151 .cse17))) v_prenex_151) (<= .cse9 v_prenex_142) (= 0 (select v_prenex_144 .cse3)) (= (let ((.cse18 (@diff v_prenex_149 v_prenex_144))) (store v_prenex_149 .cse18 (select v_prenex_144 .cse18))) v_prenex_144) (= (select v_prenex_145 v_prenex_143) 0) (= (select v_prenex_150 v_prenex_143) 1) (not (= 0 v_prenex_142)) (= (select v_prenex_149 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_149 .cse5) 0) (= (select v_prenex_145 v_prenex_142) 1) (<= .cse16 v_prenex_146) (<= .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select (store v_prenex_144 .cse3 1) .cse19)) (= (select v_prenex_147 v_prenex_148) 0) (= (select v_prenex_147 v_prenex_146) 1) (= (let ((.cse20 (@diff v_prenex_145 v_prenex_150))) (store v_prenex_145 .cse20 (select v_prenex_150 .cse20))) v_prenex_150))))) (= .cse2 .cse5))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-16 03:44:55,302 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (+ .cse3 2))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse1 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0)) (.cse2 (select .cse21 4)) (.cse5 (select .cse21 0))) (or (let ((.cse0 (+ .cse5 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_48| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse3 1) .cse5)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse6 (+ v_arrayElimIndex_49 2))) (and (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_45| .cse8))) |v_#valid_BEFORE_CALL_45|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))) (and .cse1 (or (let ((.cse12 (+ .cse2 2))) (and (exists ((v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_140 Int) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse10 (+ v_prenex_140 2))) (and (not (= 0 v_prenex_132)) (= (select v_prenex_136 v_prenex_139) 1) (<= .cse10 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (<= .cse9 v_prenex_132) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse11 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse11 (select v_prenex_138 .cse11))) v_prenex_138) (<= .cse12 v_prenex_137) (not (= 0 v_prenex_137)) (= (let ((.cse13 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse13 (select v_prenex_136 .cse13))) v_prenex_136) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse10 v_prenex_137) (<= .cse12 v_prenex_132) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_131 v_prenex_139) 0) (= (select v_prenex_133 v_prenex_132) 1) (<= .cse9 v_prenex_137) (= (select v_prenex_133 v_prenex_134) 0)))) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_135 (Array Int Int))) (and (= 0 (select v_prenex_141 .cse3)) (= (select v_prenex_141 .cse5) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse14 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse14 (select v_prenex_141 .cse14))) v_prenex_141) (= (select v_prenex_135 .cse5) 0) (= 0 (select (store v_prenex_141 .cse3 1) .cse2)))) (<= .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_prenex_150 (Array Int Int)) (v_prenex_151 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_144 (Array Int Int)) (v_prenex_145 (Array Int Int)) (v_prenex_147 (Array Int Int)) (v_prenex_149 (Array Int Int)) (v_prenex_148 Int) (v_prenex_146 Int) (v_prenex_143 Int) (v_prenex_152 Int) (v_prenex_142 Int)) (let ((.cse19 (select .cse21 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse16 (+ v_prenex_152 2)) (.cse15 (+ .cse19 2))) (and (<= .cse15 v_prenex_146) (= 0 (select v_prenex_150 v_prenex_152)) (= (select v_prenex_144 .cse5) 1) (<= .cse9 v_prenex_146) (= (select v_prenex_151 v_prenex_148) 1) (<= .cse16 v_prenex_142) (not (= 0 v_prenex_146)) (<= .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse15 v_prenex_142) (= (let ((.cse17 (@diff v_prenex_147 v_prenex_151))) (store v_prenex_147 .cse17 (select v_prenex_151 .cse17))) v_prenex_151) (<= .cse9 v_prenex_142) (= 0 (select v_prenex_144 .cse3)) (= (let ((.cse18 (@diff v_prenex_149 v_prenex_144))) (store v_prenex_149 .cse18 (select v_prenex_144 .cse18))) v_prenex_144) (= (select v_prenex_145 v_prenex_143) 0) (= (select v_prenex_150 v_prenex_143) 1) (not (= 0 v_prenex_142)) (= (select v_prenex_149 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_149 .cse5) 0) (= (select v_prenex_145 v_prenex_142) 1) (<= .cse16 v_prenex_146) (<= .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select (store v_prenex_144 .cse3 1) .cse19)) (= (select v_prenex_147 v_prenex_148) 0) (= (select v_prenex_147 v_prenex_146) 1) (= (let ((.cse20 (@diff v_prenex_145 v_prenex_150))) (store v_prenex_145 .cse20 (select v_prenex_150 .cse20))) v_prenex_150))))) (= .cse2 .cse5))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-16 03:44:58,299 WARN L837 $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 ((.cse2 (+ .cse6 2))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse16 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse7 (select .cse16 0))) (let ((.cse0 (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse7)) (.cse9 (select .cse16 4))) (or (and .cse0 (or (let ((.cse4 (+ .cse9 2))) (and (exists ((v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_140 Int) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse1 (+ v_prenex_140 2))) (and (not (= 0 v_prenex_132)) (= (select v_prenex_136 v_prenex_139) 1) (<= .cse1 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (<= .cse2 v_prenex_132) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse3 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse3 (select v_prenex_138 .cse3))) v_prenex_138) (<= .cse4 v_prenex_137) (not (= 0 v_prenex_137)) (= (let ((.cse5 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse5 (select v_prenex_136 .cse5))) v_prenex_136) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse1 v_prenex_137) (<= .cse4 v_prenex_132) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_131 v_prenex_139) 0) (= (select v_prenex_133 v_prenex_132) 1) (<= .cse2 v_prenex_137) (= (select v_prenex_133 v_prenex_134) 0)))) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_135 (Array Int Int))) (and (= 0 (select v_prenex_141 .cse6)) (= (select v_prenex_141 .cse7) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse8 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse8 (select v_prenex_141 .cse8))) v_prenex_141) (= (select v_prenex_135 .cse7) 0) (= 0 (select (store v_prenex_141 .cse6 1) .cse9)))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_prenex_150 (Array Int Int)) (v_prenex_151 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_144 (Array Int Int)) (v_prenex_145 (Array Int Int)) (v_prenex_147 (Array Int Int)) (v_prenex_149 (Array Int Int)) (v_prenex_148 Int) (v_prenex_146 Int) (v_prenex_143 Int) (v_prenex_152 Int) (v_prenex_142 Int)) (let ((.cse14 (select .cse16 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse11 (+ v_prenex_152 2)) (.cse10 (+ .cse14 2))) (and (<= .cse10 v_prenex_146) (= 0 (select v_prenex_150 v_prenex_152)) (= (select v_prenex_144 .cse7) 1) (<= .cse2 v_prenex_146) (= (select v_prenex_151 v_prenex_148) 1) (<= .cse11 v_prenex_142) (not (= 0 v_prenex_146)) (<= .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse10 v_prenex_142) (= (let ((.cse12 (@diff v_prenex_147 v_prenex_151))) (store v_prenex_147 .cse12 (select v_prenex_151 .cse12))) v_prenex_151) (<= .cse2 v_prenex_142) (= 0 (select v_prenex_144 .cse6)) (= (let ((.cse13 (@diff v_prenex_149 v_prenex_144))) (store v_prenex_149 .cse13 (select v_prenex_144 .cse13))) v_prenex_144) (= (select v_prenex_145 v_prenex_143) 0) (= (select v_prenex_150 v_prenex_143) 1) (not (= 0 v_prenex_142)) (= (select v_prenex_149 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_149 .cse7) 0) (= (select v_prenex_145 v_prenex_142) 1) (<= .cse11 v_prenex_146) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select (store v_prenex_144 .cse6 1) .cse14)) (= (select v_prenex_147 v_prenex_148) 0) (= (select v_prenex_147 v_prenex_146) 1) (= (let ((.cse15 (@diff v_prenex_145 v_prenex_150))) (store v_prenex_145 .cse15 (select v_prenex_150 .cse15))) v_prenex_150))))) (= .cse9 .cse7)))) (let ((.cse17 (+ .cse7 2))) (and .cse0 (<= .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_48| .cse9) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse18 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse18 (select |v_#valid_BEFORE_CALL_48| .cse18))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse9) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse6 1) .cse7)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse19 (+ v_arrayElimIndex_49 2))) (and (<= .cse19 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse20 (select |v_#valid_BEFORE_CALL_44| .cse20))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse21 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse21 (select |v_#valid_BEFORE_CALL_45| .cse21))) |v_#valid_BEFORE_CALL_45|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse17 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse17 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse19 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))))))) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-16 03:44:58,309 WARN L859 $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 ((.cse2 (+ .cse6 2))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse16 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse7 (select .cse16 0))) (let ((.cse0 (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse7)) (.cse9 (select .cse16 4))) (or (and .cse0 (or (let ((.cse4 (+ .cse9 2))) (and (exists ((v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_140 Int) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse1 (+ v_prenex_140 2))) (and (not (= 0 v_prenex_132)) (= (select v_prenex_136 v_prenex_139) 1) (<= .cse1 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (<= .cse2 v_prenex_132) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse3 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse3 (select v_prenex_138 .cse3))) v_prenex_138) (<= .cse4 v_prenex_137) (not (= 0 v_prenex_137)) (= (let ((.cse5 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse5 (select v_prenex_136 .cse5))) v_prenex_136) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse1 v_prenex_137) (<= .cse4 v_prenex_132) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_131 v_prenex_139) 0) (= (select v_prenex_133 v_prenex_132) 1) (<= .cse2 v_prenex_137) (= (select v_prenex_133 v_prenex_134) 0)))) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_135 (Array Int Int))) (and (= 0 (select v_prenex_141 .cse6)) (= (select v_prenex_141 .cse7) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse8 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse8 (select v_prenex_141 .cse8))) v_prenex_141) (= (select v_prenex_135 .cse7) 0) (= 0 (select (store v_prenex_141 .cse6 1) .cse9)))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_prenex_150 (Array Int Int)) (v_prenex_151 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_144 (Array Int Int)) (v_prenex_145 (Array Int Int)) (v_prenex_147 (Array Int Int)) (v_prenex_149 (Array Int Int)) (v_prenex_148 Int) (v_prenex_146 Int) (v_prenex_143 Int) (v_prenex_152 Int) (v_prenex_142 Int)) (let ((.cse14 (select .cse16 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse11 (+ v_prenex_152 2)) (.cse10 (+ .cse14 2))) (and (<= .cse10 v_prenex_146) (= 0 (select v_prenex_150 v_prenex_152)) (= (select v_prenex_144 .cse7) 1) (<= .cse2 v_prenex_146) (= (select v_prenex_151 v_prenex_148) 1) (<= .cse11 v_prenex_142) (not (= 0 v_prenex_146)) (<= .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse10 v_prenex_142) (= (let ((.cse12 (@diff v_prenex_147 v_prenex_151))) (store v_prenex_147 .cse12 (select v_prenex_151 .cse12))) v_prenex_151) (<= .cse2 v_prenex_142) (= 0 (select v_prenex_144 .cse6)) (= (let ((.cse13 (@diff v_prenex_149 v_prenex_144))) (store v_prenex_149 .cse13 (select v_prenex_144 .cse13))) v_prenex_144) (= (select v_prenex_145 v_prenex_143) 0) (= (select v_prenex_150 v_prenex_143) 1) (not (= 0 v_prenex_142)) (= (select v_prenex_149 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_149 .cse7) 0) (= (select v_prenex_145 v_prenex_142) 1) (<= .cse11 v_prenex_146) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select (store v_prenex_144 .cse6 1) .cse14)) (= (select v_prenex_147 v_prenex_148) 0) (= (select v_prenex_147 v_prenex_146) 1) (= (let ((.cse15 (@diff v_prenex_145 v_prenex_150))) (store v_prenex_145 .cse15 (select v_prenex_150 .cse15))) v_prenex_150))))) (= .cse9 .cse7)))) (let ((.cse17 (+ .cse7 2))) (and .cse0 (<= .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_48| .cse9) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse18 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse18 (select |v_#valid_BEFORE_CALL_48| .cse18))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse9) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse6 1) .cse7)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse19 (+ v_arrayElimIndex_49 2))) (and (<= .cse19 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse20 (select |v_#valid_BEFORE_CALL_44| .cse20))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse21 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse21 (select |v_#valid_BEFORE_CALL_45| .cse21))) |v_#valid_BEFORE_CALL_45|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse17 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse17 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse19 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))))))) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-16 03:45:00,575 WARN L837 $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 ((.cse2 (+ .cse6 2))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse16 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse7 (select .cse16 0))) (let ((.cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse7)) (.cse9 (select .cse16 4))) (or (and .cse0 (or (let ((.cse4 (+ .cse9 2))) (and (exists ((v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_140 Int) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse1 (+ v_prenex_140 2))) (and (not (= 0 v_prenex_132)) (= (select v_prenex_136 v_prenex_139) 1) (<= .cse1 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (<= .cse2 v_prenex_132) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse3 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse3 (select v_prenex_138 .cse3))) v_prenex_138) (<= .cse4 v_prenex_137) (not (= 0 v_prenex_137)) (= (let ((.cse5 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse5 (select v_prenex_136 .cse5))) v_prenex_136) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse1 v_prenex_137) (<= .cse4 v_prenex_132) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_131 v_prenex_139) 0) (= (select v_prenex_133 v_prenex_132) 1) (<= .cse2 v_prenex_137) (= (select v_prenex_133 v_prenex_134) 0)))) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_135 (Array Int Int))) (and (= 0 (select v_prenex_141 .cse6)) (= (select v_prenex_141 .cse7) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse8 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse8 (select v_prenex_141 .cse8))) v_prenex_141) (= (select v_prenex_135 .cse7) 0) (= 0 (select (store v_prenex_141 .cse6 1) .cse9)))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_prenex_150 (Array Int Int)) (v_prenex_151 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_144 (Array Int Int)) (v_prenex_145 (Array Int Int)) (v_prenex_147 (Array Int Int)) (v_prenex_149 (Array Int Int)) (v_prenex_148 Int) (v_prenex_146 Int) (v_prenex_143 Int) (v_prenex_152 Int) (v_prenex_142 Int)) (let ((.cse14 (select .cse16 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse11 (+ v_prenex_152 2)) (.cse10 (+ .cse14 2))) (and (<= .cse10 v_prenex_146) (= 0 (select v_prenex_150 v_prenex_152)) (= (select v_prenex_144 .cse7) 1) (<= .cse2 v_prenex_146) (= (select v_prenex_151 v_prenex_148) 1) (<= .cse11 v_prenex_142) (not (= 0 v_prenex_146)) (<= .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse10 v_prenex_142) (= (let ((.cse12 (@diff v_prenex_147 v_prenex_151))) (store v_prenex_147 .cse12 (select v_prenex_151 .cse12))) v_prenex_151) (<= .cse2 v_prenex_142) (= 0 (select v_prenex_144 .cse6)) (= (let ((.cse13 (@diff v_prenex_149 v_prenex_144))) (store v_prenex_149 .cse13 (select v_prenex_144 .cse13))) v_prenex_144) (= (select v_prenex_145 v_prenex_143) 0) (= (select v_prenex_150 v_prenex_143) 1) (not (= 0 v_prenex_142)) (= (select v_prenex_149 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_149 .cse7) 0) (= (select v_prenex_145 v_prenex_142) 1) (<= .cse11 v_prenex_146) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select (store v_prenex_144 .cse6 1) .cse14)) (= (select v_prenex_147 v_prenex_148) 0) (= (select v_prenex_147 v_prenex_146) 1) (= (let ((.cse15 (@diff v_prenex_145 v_prenex_150))) (store v_prenex_145 .cse15 (select v_prenex_150 .cse15))) v_prenex_150))))) (= .cse9 .cse7)))) (let ((.cse17 (+ .cse7 2))) (and (<= .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0 (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_48| .cse9) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse18 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse18 (select |v_#valid_BEFORE_CALL_48| .cse18))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse9) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse6 1) .cse7)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse19 (+ v_arrayElimIndex_49 2))) (and (<= .cse19 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse20 (select |v_#valid_BEFORE_CALL_44| .cse20))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse21 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse21 (select |v_#valid_BEFORE_CALL_45| .cse21))) |v_#valid_BEFORE_CALL_45|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse17 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse17 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse19 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))))))) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-16 03:45:00,587 WARN L859 $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 ((.cse2 (+ .cse6 2))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse16 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse7 (select .cse16 0))) (let ((.cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse7)) (.cse9 (select .cse16 4))) (or (and .cse0 (or (let ((.cse4 (+ .cse9 2))) (and (exists ((v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_140 Int) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse1 (+ v_prenex_140 2))) (and (not (= 0 v_prenex_132)) (= (select v_prenex_136 v_prenex_139) 1) (<= .cse1 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (<= .cse2 v_prenex_132) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse3 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse3 (select v_prenex_138 .cse3))) v_prenex_138) (<= .cse4 v_prenex_137) (not (= 0 v_prenex_137)) (= (let ((.cse5 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse5 (select v_prenex_136 .cse5))) v_prenex_136) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse1 v_prenex_137) (<= .cse4 v_prenex_132) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_131 v_prenex_139) 0) (= (select v_prenex_133 v_prenex_132) 1) (<= .cse2 v_prenex_137) (= (select v_prenex_133 v_prenex_134) 0)))) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_135 (Array Int Int))) (and (= 0 (select v_prenex_141 .cse6)) (= (select v_prenex_141 .cse7) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse8 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse8 (select v_prenex_141 .cse8))) v_prenex_141) (= (select v_prenex_135 .cse7) 0) (= 0 (select (store v_prenex_141 .cse6 1) .cse9)))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_prenex_150 (Array Int Int)) (v_prenex_151 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_144 (Array Int Int)) (v_prenex_145 (Array Int Int)) (v_prenex_147 (Array Int Int)) (v_prenex_149 (Array Int Int)) (v_prenex_148 Int) (v_prenex_146 Int) (v_prenex_143 Int) (v_prenex_152 Int) (v_prenex_142 Int)) (let ((.cse14 (select .cse16 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse11 (+ v_prenex_152 2)) (.cse10 (+ .cse14 2))) (and (<= .cse10 v_prenex_146) (= 0 (select v_prenex_150 v_prenex_152)) (= (select v_prenex_144 .cse7) 1) (<= .cse2 v_prenex_146) (= (select v_prenex_151 v_prenex_148) 1) (<= .cse11 v_prenex_142) (not (= 0 v_prenex_146)) (<= .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse10 v_prenex_142) (= (let ((.cse12 (@diff v_prenex_147 v_prenex_151))) (store v_prenex_147 .cse12 (select v_prenex_151 .cse12))) v_prenex_151) (<= .cse2 v_prenex_142) (= 0 (select v_prenex_144 .cse6)) (= (let ((.cse13 (@diff v_prenex_149 v_prenex_144))) (store v_prenex_149 .cse13 (select v_prenex_144 .cse13))) v_prenex_144) (= (select v_prenex_145 v_prenex_143) 0) (= (select v_prenex_150 v_prenex_143) 1) (not (= 0 v_prenex_142)) (= (select v_prenex_149 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_149 .cse7) 0) (= (select v_prenex_145 v_prenex_142) 1) (<= .cse11 v_prenex_146) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select (store v_prenex_144 .cse6 1) .cse14)) (= (select v_prenex_147 v_prenex_148) 0) (= (select v_prenex_147 v_prenex_146) 1) (= (let ((.cse15 (@diff v_prenex_145 v_prenex_150))) (store v_prenex_145 .cse15 (select v_prenex_150 .cse15))) v_prenex_150))))) (= .cse9 .cse7)))) (let ((.cse17 (+ .cse7 2))) (and (<= .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0 (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_48| .cse9) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse18 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse18 (select |v_#valid_BEFORE_CALL_48| .cse18))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse9) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse6 1) .cse7)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse19 (+ v_arrayElimIndex_49 2))) (and (<= .cse19 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse20 (select |v_#valid_BEFORE_CALL_44| .cse20))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse21 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse21 (select |v_#valid_BEFORE_CALL_45| .cse21))) |v_#valid_BEFORE_CALL_45|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse17 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse17 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse19 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))))))) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-16 03:45:00,696 INFO L321 Elim1Store]: treesize reduction 22, result has 46.3 percent of original size [2023-02-16 03:45:00,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 705 treesize of output 486 [2023-02-16 03:45:04,617 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~mem17#1.base| 2))) (or (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_arrayElimCell_294 Int)) (let ((.cse1 (+ v_arrayElimCell_294 2))) (and (exists ((v_prenex_144 (Array Int Int)) (v_prenex_149 (Array Int Int))) (and (= (let ((.cse0 (@diff v_prenex_149 v_prenex_144))) (store v_prenex_149 .cse0 (select v_prenex_144 .cse0))) v_prenex_144) (= (select v_prenex_144 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_149 |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_149 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select (store v_prenex_144 |c_ULTIMATE.start_main_#t~mem17#1.base| 1) v_arrayElimCell_294)) (= 0 (select v_prenex_144 |c_ULTIMATE.start_main_#t~mem17#1.base|)))) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_prenex_148 Int) (v_prenex_150 (Array Int Int)) (v_prenex_146 Int) (v_prenex_151 (Array Int Int)) (v_prenex_143 Int) (v_prenex_152 Int) (v_prenex_142 Int) (v_prenex_145 (Array Int Int)) (v_prenex_147 (Array Int Int))) (let ((.cse3 (+ v_prenex_152 2))) (and (= 0 (select v_prenex_150 v_prenex_152)) (<= .cse1 v_prenex_146) (= (select v_prenex_145 v_prenex_143) 0) (= (select v_prenex_150 v_prenex_143) 1) (<= .cse2 v_prenex_142) (<= .cse2 v_prenex_146) (= (select v_prenex_151 v_prenex_148) 1) (not (= 0 v_prenex_142)) (<= .cse3 v_prenex_142) (not (= 0 v_prenex_146)) (= (select v_prenex_145 v_prenex_142) 1) (<= .cse3 v_prenex_146) (= (select v_prenex_147 v_prenex_148) 0) (= (select v_prenex_147 v_prenex_146) 1) (= (let ((.cse4 (@diff v_prenex_147 v_prenex_151))) (store v_prenex_147 .cse4 (select v_prenex_151 .cse4))) v_prenex_151) (<= .cse1 v_prenex_142) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse5 (@diff v_prenex_145 v_prenex_150))) (store v_prenex_145 .cse5 (select v_prenex_150 .cse5))) v_prenex_150))))))) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse9 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse6 (+ v_arrayElimIndex_49 2))) (and (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_45| .cse8))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse6 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (<= .cse9 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_292 Int) (|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse10 (select |v_#valid_BEFORE_CALL_48| .cse10))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_292) 1) (= (select |v_old(#valid)_AFTER_CALL_54| v_arrayElimCell_292) 0) (= (select |v_old(#valid)_AFTER_CALL_54| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select (store |v_#valid_BEFORE_CALL_48| |c_ULTIMATE.start_main_#t~mem17#1.base| 1) |c_ULTIMATE.start_main_~ptr~0#1.base|))))))) (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_arrayElimCell_292 Int)) (let ((.cse11 (+ v_arrayElimCell_292 2))) (and (<= .cse11 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_135 (Array Int Int))) (and (= 0 (select (store v_prenex_141 |c_ULTIMATE.start_main_#t~mem17#1.base| 1) v_arrayElimCell_292)) (= (select v_prenex_141 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select v_prenex_141 |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (let ((.cse12 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse12 (select v_prenex_141 .cse12))) v_prenex_141) (= (select v_prenex_135 |ULTIMATE.start_main_~#s~0#1.base|) 1))) (exists ((v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_140 Int) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse13 (+ v_prenex_140 2))) (and (not (= 0 v_prenex_132)) (<= .cse2 v_prenex_137) (<= .cse11 v_prenex_137) (= (select v_prenex_136 v_prenex_139) 1) (<= .cse13 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (<= .cse2 v_prenex_132) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse14 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse14 (select v_prenex_138 .cse14))) v_prenex_138) (not (= 0 v_prenex_137)) (= (let ((.cse15 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse15 (select v_prenex_136 .cse15))) v_prenex_136) (<= .cse13 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse13 v_prenex_137) (<= .cse11 v_prenex_132) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_131 v_prenex_139) 0) (= (select v_prenex_133 v_prenex_132) 1) (= (select v_prenex_133 v_prenex_134) 0))))))) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_135 (Array Int Int)) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int)) (v_arrayElimCell_292 Int) (v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_140 Int)) (let ((.cse16 (+ v_arrayElimCell_292 2)) (.cse19 (+ v_prenex_140 2))) (and (<= .cse16 |ULTIMATE.start_main_~#s~0#1.base|) (= (select v_prenex_136 v_prenex_139) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse17 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse17 (select v_prenex_141 .cse17))) v_prenex_141) (= (let ((.cse18 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse18 (select v_prenex_136 .cse18))) v_prenex_136) (= 0 (select (store v_prenex_141 |c_ULTIMATE.start_main_#t~mem17#1.base| 1) v_arrayElimCell_292)) (= (select v_prenex_141 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= .cse19 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse16 v_prenex_132) (= (select v_prenex_131 v_prenex_139) 0) (= 0 (select v_prenex_141 |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (select v_prenex_135 |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_133 v_prenex_134) 0) (not (= 0 v_prenex_132)) (<= .cse2 v_prenex_137) (<= .cse16 v_prenex_137) (<= .cse19 v_prenex_132) (<= .cse2 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (= (let ((.cse20 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse20 (select v_prenex_138 .cse20))) v_prenex_138) (not (= 0 v_prenex_137)) (<= .cse19 v_prenex_137) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_133 v_prenex_132) 1)))) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2023-02-16 03:45:04,630 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~mem17#1.base| 2))) (or (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_arrayElimCell_294 Int)) (let ((.cse1 (+ v_arrayElimCell_294 2))) (and (exists ((v_prenex_144 (Array Int Int)) (v_prenex_149 (Array Int Int))) (and (= (let ((.cse0 (@diff v_prenex_149 v_prenex_144))) (store v_prenex_149 .cse0 (select v_prenex_144 .cse0))) v_prenex_144) (= (select v_prenex_144 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_149 |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_149 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select (store v_prenex_144 |c_ULTIMATE.start_main_#t~mem17#1.base| 1) v_arrayElimCell_294)) (= 0 (select v_prenex_144 |c_ULTIMATE.start_main_#t~mem17#1.base|)))) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_prenex_148 Int) (v_prenex_150 (Array Int Int)) (v_prenex_146 Int) (v_prenex_151 (Array Int Int)) (v_prenex_143 Int) (v_prenex_152 Int) (v_prenex_142 Int) (v_prenex_145 (Array Int Int)) (v_prenex_147 (Array Int Int))) (let ((.cse3 (+ v_prenex_152 2))) (and (= 0 (select v_prenex_150 v_prenex_152)) (<= .cse1 v_prenex_146) (= (select v_prenex_145 v_prenex_143) 0) (= (select v_prenex_150 v_prenex_143) 1) (<= .cse2 v_prenex_142) (<= .cse2 v_prenex_146) (= (select v_prenex_151 v_prenex_148) 1) (not (= 0 v_prenex_142)) (<= .cse3 v_prenex_142) (not (= 0 v_prenex_146)) (= (select v_prenex_145 v_prenex_142) 1) (<= .cse3 v_prenex_146) (= (select v_prenex_147 v_prenex_148) 0) (= (select v_prenex_147 v_prenex_146) 1) (= (let ((.cse4 (@diff v_prenex_147 v_prenex_151))) (store v_prenex_147 .cse4 (select v_prenex_151 .cse4))) v_prenex_151) (<= .cse1 v_prenex_142) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse5 (@diff v_prenex_145 v_prenex_150))) (store v_prenex_145 .cse5 (select v_prenex_150 .cse5))) v_prenex_150))))))) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse9 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse6 (+ v_arrayElimIndex_49 2))) (and (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_45| .cse8))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse6 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (<= .cse9 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_292 Int) (|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse10 (select |v_#valid_BEFORE_CALL_48| .cse10))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_292) 1) (= (select |v_old(#valid)_AFTER_CALL_54| v_arrayElimCell_292) 0) (= (select |v_old(#valid)_AFTER_CALL_54| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select (store |v_#valid_BEFORE_CALL_48| |c_ULTIMATE.start_main_#t~mem17#1.base| 1) |c_ULTIMATE.start_main_~ptr~0#1.base|))))))) (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_arrayElimCell_292 Int)) (let ((.cse11 (+ v_arrayElimCell_292 2))) (and (<= .cse11 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_135 (Array Int Int))) (and (= 0 (select (store v_prenex_141 |c_ULTIMATE.start_main_#t~mem17#1.base| 1) v_arrayElimCell_292)) (= (select v_prenex_141 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select v_prenex_141 |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (let ((.cse12 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse12 (select v_prenex_141 .cse12))) v_prenex_141) (= (select v_prenex_135 |ULTIMATE.start_main_~#s~0#1.base|) 1))) (exists ((v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_140 Int) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse13 (+ v_prenex_140 2))) (and (not (= 0 v_prenex_132)) (<= .cse2 v_prenex_137) (<= .cse11 v_prenex_137) (= (select v_prenex_136 v_prenex_139) 1) (<= .cse13 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (<= .cse2 v_prenex_132) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse14 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse14 (select v_prenex_138 .cse14))) v_prenex_138) (not (= 0 v_prenex_137)) (= (let ((.cse15 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse15 (select v_prenex_136 .cse15))) v_prenex_136) (<= .cse13 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse13 v_prenex_137) (<= .cse11 v_prenex_132) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_131 v_prenex_139) 0) (= (select v_prenex_133 v_prenex_132) 1) (= (select v_prenex_133 v_prenex_134) 0))))))) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_135 (Array Int Int)) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int)) (v_arrayElimCell_292 Int) (v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_140 Int)) (let ((.cse16 (+ v_arrayElimCell_292 2)) (.cse19 (+ v_prenex_140 2))) (and (<= .cse16 |ULTIMATE.start_main_~#s~0#1.base|) (= (select v_prenex_136 v_prenex_139) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse17 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse17 (select v_prenex_141 .cse17))) v_prenex_141) (= (let ((.cse18 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse18 (select v_prenex_136 .cse18))) v_prenex_136) (= 0 (select (store v_prenex_141 |c_ULTIMATE.start_main_#t~mem17#1.base| 1) v_arrayElimCell_292)) (= (select v_prenex_141 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= .cse19 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse16 v_prenex_132) (= (select v_prenex_131 v_prenex_139) 0) (= 0 (select v_prenex_141 |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (select v_prenex_135 |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_133 v_prenex_134) 0) (not (= 0 v_prenex_132)) (<= .cse2 v_prenex_137) (<= .cse16 v_prenex_137) (<= .cse19 v_prenex_132) (<= .cse2 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (= (let ((.cse20 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse20 (select v_prenex_138 .cse20))) v_prenex_138) (not (= 0 v_prenex_137)) (<= .cse19 v_prenex_137) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_133 v_prenex_132) 1)))) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2023-02-16 03:45:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2023-02-16 03:45:04,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:45:04,854 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_ArrVal_5925 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_5925) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-02-16 03:45:05,044 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5918 (Array Int Int)) (v_ArrVal_5919 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_ArrVal_5923 (Array Int Int)) (v_ArrVal_5922 (Array Int Int)) (v_ArrVal_5925 (Array Int Int))) (not (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5918) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5922))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (store .cse3 .cse2 (store (select .cse3 .cse2) (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5919) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5923) .cse2 v_ArrVal_5925) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2023-02-16 03:45:05,054 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5918 (Array Int Int)) (v_ArrVal_5919 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_ArrVal_5923 (Array Int Int)) (v_ArrVal_5922 (Array Int Int)) (v_ArrVal_5925 (Array Int Int))) (not (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5918) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5922))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (store .cse3 .cse2 (store (select .cse3 .cse2) (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5919) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5923) .cse2 v_ArrVal_5925) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2023-02-16 03:45:05,064 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5918 (Array Int Int)) (v_ArrVal_5919 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_ArrVal_5923 (Array Int Int)) (v_ArrVal_5922 (Array Int Int)) (v_ArrVal_5925 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_5918) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5922))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_5919) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5923) .cse3 v_ArrVal_5925) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2023-02-16 03:45:05,078 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5918 (Array Int Int)) (v_ArrVal_5919 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_ArrVal_5923 (Array Int Int)) (v_ArrVal_5922 (Array Int Int)) (v_ArrVal_5925 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_5918) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5922))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_5919) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5923) .cse3 v_ArrVal_5925) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2023-02-16 03:45:05,097 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5918 (Array Int Int)) (v_ArrVal_5919 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_ArrVal_5923 (Array Int Int)) (v_ArrVal_5922 (Array Int Int)) (v_ArrVal_5925 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_5918) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5922))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (store .cse4 .cse3 (store (select .cse4 .cse3) (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_5919) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5923) .cse3 v_ArrVal_5925) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2023-02-16 03:45:05,189 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:45:05,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 775 treesize of output 542 [2023-02-16 03:45:05,214 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5918 (Array Int Int)) (v_ArrVal_5919 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_5940 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_ArrVal_5923 (Array Int Int)) (v_ArrVal_5922 (Array Int Int)) (v_ArrVal_5925 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36|))) (not (= (select v_arrayElimArr_3 4) 0)) (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| v_arrayElimArr_3)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| v_ArrVal_5940))) (let ((.cse3 (select (select .cse6 (select (select .cse6 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse5 (store (store .cse6 .cse3 v_ArrVal_5918) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| v_ArrVal_5922))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (store .cse5 .cse4 (store (select .cse5 .cse4) (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36|)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store (store .cse2 .cse3 v_ArrVal_5919) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_36| v_ArrVal_5923) .cse4 v_ArrVal_5925) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))))) is different from false [2023-02-16 03:45:05,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013545571] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:45:05,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:45:05,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 42] total 78 [2023-02-16 03:45:05,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345402899] [2023-02-16 03:45:05,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:45:05,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2023-02-16 03:45:05,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:45:05,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2023-02-16 03:45:05,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1726, Unknown=128, NotChecked=5418, Total=7482 [2023-02-16 03:45:05,219 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 78 states, 74 states have (on average 1.527027027027027) internal successors, (113), 68 states have internal predecessors, (113), 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) [2023-02-16 03:45:05,772 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|)) (.cse1 (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= 1 .cse0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|)) (= 1 .cse1) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_50| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_50| .cse2 (select |c_#valid| .cse2))) |c_#valid|))) (= .cse0 1) (= .cse1 1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2023-02-16 03:45:05,774 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|)) (.cse1 (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= 1 .cse0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|)) (= 1 .cse1) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_50| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_50| .cse2 (select |c_#valid| .cse2))) |c_#valid|))) (= .cse0 1) (= .cse1 1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from true [2023-02-16 03:45:05,777 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |c_#valid| .cse0))) |c_#valid|))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from false [2023-02-16 03:45:05,779 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |c_#valid| .cse0))) |c_#valid|))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from true [2023-02-16 03:45:05,797 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#length| |c_old(#length)|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_int| |c_old(#memory_int)|)) is different from false [2023-02-16 03:45:05,799 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#length| |c_old(#length)|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_int| |c_old(#memory_int)|)) is different from true [2023-02-16 03:45:05,802 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (= 0 .cse0) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|)) |c_#valid|) (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= .cse0 0) (not (= 0 |c_node_create_~temp~0#1.base|)) (= 0 |c_node_create_~temp~0#1.offset|) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from false [2023-02-16 03:45:05,804 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (= 0 .cse0) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|)) |c_#valid|) (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= .cse0 0) (not (= 0 |c_node_create_~temp~0#1.base|)) (= 0 |c_node_create_~temp~0#1.offset|) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-16 03:45:05,807 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) (.cse3 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_$Pointer$.base|) (= 0 .cse1) (= (select .cse0 |c_node_create_~temp~0#1.offset|) 0) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2) |c_#memory_$Pointer$.offset|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= 0 |c_node_create_~temp~0#1.offset|) (= .cse3 1) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse3) |c_#valid|) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_50| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= .cse1 0) (not (= 0 |c_node_create_~temp~0#1.base|)) (= |c_node_create_~temp~0#1.offset| 0) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from false [2023-02-16 03:45:05,809 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) (.cse3 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_$Pointer$.base|) (= 0 .cse1) (= (select .cse0 |c_node_create_~temp~0#1.offset|) 0) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2) |c_#memory_$Pointer$.offset|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= 0 |c_node_create_~temp~0#1.offset|) (= .cse3 1) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse3) |c_#valid|) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_50| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= .cse1 0) (not (= 0 |c_node_create_~temp~0#1.base|)) (= |c_node_create_~temp~0#1.offset| 0) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-16 03:45:05,821 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse1))) (let ((.cse10 (store |c_old(#memory_$Pointer$.offset)| .cse1 .cse0))) (let ((.cse8 (@diff .cse10 |c_#memory_$Pointer$.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.offset| .cse8))) (let ((.cse4 (store .cse10 .cse8 .cse9))) (let ((.cse2 (@diff .cse4 |c_#memory_$Pointer$.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse6 (select |c_old(#valid)| |c_node_create_#res#1.base|)) (.cse5 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (and (= |c_node_create_#res#1.offset| 0) (or (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|) (and (= (select .cse0 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse1) 0) 0))) (or (and (= (select (select |c_#memory_$Pointer$.base| .cse2) 0) 0) (= (select .cse3 0) 0)) (= .cse4 |c_#memory_$Pointer$.offset|)) (= (store |c_old(#memory_$Pointer$.base)| .cse5 (select |c_#memory_$Pointer$.base| .cse5)) |c_#memory_$Pointer$.base|) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) 0) 0) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= 0 .cse6) (= (store .cse4 .cse2 .cse3) |c_#memory_$Pointer$.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_50| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (or (and (= (select (select |c_#memory_$Pointer$.base| .cse8) 0) 0) (= (select .cse9 0) 0)) (= .cse10 |c_#memory_$Pointer$.offset|)) (not (= 0 |c_node_create_#res#1.base|)) (= .cse6 0) (or (= .cse5 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (let ((.cse11 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse11 (select |c_#valid| .cse11))) |c_#valid|)))))))))) is different from false [2023-02-16 03:45:05,826 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse1))) (let ((.cse10 (store |c_old(#memory_$Pointer$.offset)| .cse1 .cse0))) (let ((.cse8 (@diff .cse10 |c_#memory_$Pointer$.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.offset| .cse8))) (let ((.cse4 (store .cse10 .cse8 .cse9))) (let ((.cse2 (@diff .cse4 |c_#memory_$Pointer$.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse6 (select |c_old(#valid)| |c_node_create_#res#1.base|)) (.cse5 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (and (= |c_node_create_#res#1.offset| 0) (or (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|) (and (= (select .cse0 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse1) 0) 0))) (or (and (= (select (select |c_#memory_$Pointer$.base| .cse2) 0) 0) (= (select .cse3 0) 0)) (= .cse4 |c_#memory_$Pointer$.offset|)) (= (store |c_old(#memory_$Pointer$.base)| .cse5 (select |c_#memory_$Pointer$.base| .cse5)) |c_#memory_$Pointer$.base|) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) 0) 0) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= 0 .cse6) (= (store .cse4 .cse2 .cse3) |c_#memory_$Pointer$.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_50| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (or (and (= (select (select |c_#memory_$Pointer$.base| .cse8) 0) 0) (= (select .cse9 0) 0)) (= .cse10 |c_#memory_$Pointer$.offset|)) (not (= 0 |c_node_create_#res#1.base|)) (= .cse6 0) (or (= .cse5 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (let ((.cse11 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse11 (select |c_#valid| .cse11))) |c_#valid|)))))))))) is different from true [2023-02-16 03:45:05,834 WARN L837 $PredicateComparison]: unable to prove that (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_45| .cse1))) |v_#valid_BEFORE_CALL_45|) (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|)) is different from false [2023-02-16 03:45:05,837 WARN L859 $PredicateComparison]: unable to prove that (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_45| .cse1))) |v_#valid_BEFORE_CALL_45|) (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|)) is different from true [2023-02-16 03:45:05,847 WARN L837 $PredicateComparison]: unable to prove that (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_45| .cse1))) |v_#valid_BEFORE_CALL_45|) (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) is different from false [2023-02-16 03:45:05,849 WARN L859 $PredicateComparison]: unable to prove that (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse0 (select |v_#valid_BEFORE_CALL_44| .cse0))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_45| .cse1))) |v_#valid_BEFORE_CALL_45|) (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) is different from true [2023-02-16 03:45:05,861 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse2 (select |v_#valid_BEFORE_CALL_45| .cse2))) |v_#valid_BEFORE_CALL_45|) (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2023-02-16 03:45:05,864 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse2 (select |v_#valid_BEFORE_CALL_45| .cse2))) |v_#valid_BEFORE_CALL_45|) (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from true [2023-02-16 03:45:05,873 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_45| .cse1))) |v_#valid_BEFORE_CALL_45|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_50| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) is different from false [2023-02-16 03:45:05,876 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_45| .cse1))) |v_#valid_BEFORE_CALL_45|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_50| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) is different from true [2023-02-16 03:45:05,885 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_45| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse2 (select |v_#valid_BEFORE_CALL_45| .cse2))) |v_#valid_BEFORE_CALL_45|))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) is different from false [2023-02-16 03:45:05,887 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_45| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse2 (select |v_#valid_BEFORE_CALL_45| .cse2))) |v_#valid_BEFORE_CALL_45|))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) is different from true [2023-02-16 03:45:05,895 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_45| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse2 (select |v_#valid_BEFORE_CALL_45| .cse2))) |v_#valid_BEFORE_CALL_45|))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) is different from false [2023-02-16 03:45:05,898 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_45| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse2 (select |v_#valid_BEFORE_CALL_45| .cse2))) |v_#valid_BEFORE_CALL_45|))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) is different from true [2023-02-16 03:45:05,907 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse0 (select .cse3 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse0)) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_45| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse2 (select |v_#valid_BEFORE_CALL_45| .cse2))) |v_#valid_BEFORE_CALL_45|))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= .cse0 .cse1) (= (select .cse3 0) .cse0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) is different from false [2023-02-16 03:45:05,910 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse0 (select .cse3 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse0)) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_45| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse2 (select |v_#valid_BEFORE_CALL_45| .cse2))) |v_#valid_BEFORE_CALL_45|))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= .cse0 .cse1) (= (select .cse3 0) .cse0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) is different from true [2023-02-16 03:45:05,917 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse1 (select .cse4 0)) (.cse0 (select .cse4 4))) (and (= .cse0 .cse1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse0)) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_45| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_50| .cse1) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse2 (select |v_#valid_BEFORE_CALL_45| .cse2))) |v_#valid_BEFORE_CALL_45|) (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= .cse1 .cse0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))))) is different from false [2023-02-16 03:45:05,920 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse1 (select .cse4 0)) (.cse0 (select .cse4 4))) (and (= .cse0 .cse1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse0)) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_45| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_50| .cse1) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse2 (select |v_#valid_BEFORE_CALL_45| .cse2))) |v_#valid_BEFORE_CALL_45|) (= 0 (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= .cse1 .cse0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))))) is different from true [2023-02-16 03:45:05,927 WARN L837 $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 ((.cse5 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse5 0)) (.cse3 (select .cse5 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| .cse0)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| .cse0 1)) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_45| .cse1))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_45| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (= 0 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (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_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse3 .cse2) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse2 .cse3) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (< .cse0 |c_#StackHeapBarrier|) (= 1 (select |c_#valid| .cse0)) (not (= .cse3 .cse0)))))) is different from false [2023-02-16 03:45:05,930 WARN L859 $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 ((.cse5 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse5 0)) (.cse3 (select .cse5 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| .cse0)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| .cse0 1)) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_45| .cse1))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_45| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (= 0 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (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_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse3 .cse2) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse2 .cse3) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse4 (select |v_#valid_BEFORE_CALL_44| .cse4))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (< .cse0 |c_#StackHeapBarrier|) (= 1 (select |c_#valid| .cse0)) (not (= .cse3 .cse0)))))) is different from true [2023-02-16 03:45:05,938 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#length| |c_old(#length)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_45| .cse0))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (= |c_#memory_int| |c_old(#memory_int)|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from false [2023-02-16 03:45:05,940 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#length| |c_old(#length)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse0 (select |v_#valid_BEFORE_CALL_45| .cse0))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (= |c_#memory_int| |c_old(#memory_int)|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse1 (select |v_#valid_BEFORE_CALL_44| .cse1))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from true [2023-02-16 03:45:05,948 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= 0 .cse0) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|)) |c_#valid|) (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 0) (not (= 0 |c_node_create_~temp~0#1.base|)) (= 0 |c_node_create_~temp~0#1.offset|) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_45| .cse1))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))))) is different from false [2023-02-16 03:45:05,951 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= 0 .cse0) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|)) |c_#valid|) (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 0) (not (= 0 |c_node_create_~temp~0#1.base|)) (= 0 |c_node_create_~temp~0#1.offset|) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_45| .cse1))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse2 (select |v_#valid_BEFORE_CALL_44| .cse2))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))))) is different from true [2023-02-16 03:45:05,967 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) (.cse4 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (exists ((v_ArrVal_5910 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5910))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_$Pointer$.base|) (= 0 .cse1) (= (select .cse0 |c_node_create_~temp~0#1.offset|) 0) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2) |c_#memory_$Pointer$.offset|) (= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse3 (select |v_#valid_BEFORE_CALL_45| .cse3))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (= .cse4 1) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (exists ((v_ArrVal_5911 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5911))) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse4) |c_#valid|) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= .cse1 0) (not (= 0 |c_node_create_~temp~0#1.base|)) (= |c_node_create_~temp~0#1.offset| 0) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from false [2023-02-16 03:45:05,970 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) (.cse4 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (exists ((v_ArrVal_5910 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5910))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_$Pointer$.base|) (= 0 .cse1) (= (select .cse0 |c_node_create_~temp~0#1.offset|) 0) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2) |c_#memory_$Pointer$.offset|) (= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse3 (select |v_#valid_BEFORE_CALL_45| .cse3))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (= .cse4 1) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (exists ((v_ArrVal_5911 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5911))) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse4) |c_#valid|) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= .cse1 0) (not (= 0 |c_node_create_~temp~0#1.base|)) (= |c_node_create_~temp~0#1.offset| 0) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-16 03:45:05,985 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) (.cse4 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_$Pointer$.base|) (= 0 .cse1) (= (select .cse0 |c_node_create_~temp~0#1.offset|) 0) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2) |c_#memory_$Pointer$.offset|) (= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse3 (select |v_#valid_BEFORE_CALL_45| .cse3))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (exists ((v_arrayElimArr_1 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_arrayElimArr_1)) (= (select v_arrayElimArr_1 (+ |c_node_create_~temp~0#1.offset| 4)) 0))) (= .cse4 1) (exists ((v_ArrVal_5912 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5912))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse4) |c_#valid|) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= .cse1 0) (not (= 0 |c_node_create_~temp~0#1.base|)) (= |c_node_create_~temp~0#1.offset| 0) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from false [2023-02-16 03:45:05,988 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) (.cse4 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_$Pointer$.base|) (= 0 .cse1) (= (select .cse0 |c_node_create_~temp~0#1.offset|) 0) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2) |c_#memory_$Pointer$.offset|) (= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse3 (select |v_#valid_BEFORE_CALL_45| .cse3))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (exists ((v_arrayElimArr_1 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_arrayElimArr_1)) (= (select v_arrayElimArr_1 (+ |c_node_create_~temp~0#1.offset| 4)) 0))) (= .cse4 1) (exists ((v_ArrVal_5912 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5912))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse4) |c_#valid|) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= .cse1 0) (not (= 0 |c_node_create_~temp~0#1.base|)) (= |c_node_create_~temp~0#1.offset| 0) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-16 03:45:06,007 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) (.cse4 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_$Pointer$.base|) (= 0 .cse1) (= (select .cse0 |c_node_create_~temp~0#1.offset|) 0) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2) |c_#memory_$Pointer$.offset|) (= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse3 (select |v_#valid_BEFORE_CALL_45| .cse3))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (= .cse4 1) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse4) |c_#valid|) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= .cse1 0) (not (= 0 |c_node_create_~temp~0#1.base|)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_5915 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5915))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_arrayElimArr_2 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_arrayElimArr_2)) (= (select v_arrayElimArr_2 4) 0))))) is different from false [2023-02-16 03:45:06,011 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) (.cse4 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_$Pointer$.base|) (= 0 .cse1) (= (select .cse0 |c_node_create_~temp~0#1.offset|) 0) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| .cse2) |c_#memory_$Pointer$.offset|) (= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse3 (select |v_#valid_BEFORE_CALL_45| .cse3))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (= .cse4 1) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse5 (select |v_#valid_BEFORE_CALL_44| .cse5))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse4) |c_#valid|) (= (select .cse2 |c_node_create_~temp~0#1.offset|) 0) (= .cse1 0) (not (= 0 |c_node_create_~temp~0#1.base|)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_5915 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5915))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_arrayElimArr_2 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_arrayElimArr_2)) (= (select v_arrayElimArr_2 4) 0))))) is different from true [2023-02-16 03:45:06,179 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse1))) (let ((.cse11 (store |c_old(#memory_$Pointer$.offset)| .cse1 .cse0))) (let ((.cse9 (@diff .cse11 |c_#memory_$Pointer$.offset|))) (let ((.cse10 (select |c_#memory_$Pointer$.offset| .cse9))) (let ((.cse4 (store .cse11 .cse9 .cse10))) (let ((.cse2 (@diff .cse4 |c_#memory_$Pointer$.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse7 (select |c_old(#valid)| |c_node_create_#res#1.base|)) (.cse5 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (and (exists ((v_ArrVal_5915 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_5915))) (exists ((v_arrayElimArr_2 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_arrayElimArr_2)) (= (select v_arrayElimArr_2 4) 0))) (= |c_node_create_#res#1.offset| 0) (or (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|) (and (= (select .cse0 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse1) 0) 0))) (or (and (= (select (select |c_#memory_$Pointer$.base| .cse2) 0) 0) (= (select .cse3 0) 0)) (= .cse4 |c_#memory_$Pointer$.offset|)) (= (store |c_old(#memory_$Pointer$.base)| .cse5 (select |c_#memory_$Pointer$.base| .cse5)) |c_#memory_$Pointer$.base|) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (= 0 .cse7) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse8 (select |v_#valid_BEFORE_CALL_44| .cse8))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= (store .cse4 .cse2 .cse3) |c_#memory_$Pointer$.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) 0) 0) (or (and (= (select (select |c_#memory_$Pointer$.base| .cse9) 0) 0) (= (select .cse10 0) 0)) (= .cse11 |c_#memory_$Pointer$.offset|)) (not (= 0 |c_node_create_#res#1.base|)) (= .cse7 0) (or (= .cse5 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (let ((.cse12 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse12 (select |c_#valid| .cse12))) |c_#valid|)))))))))) is different from false [2023-02-16 03:45:06,186 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse1))) (let ((.cse11 (store |c_old(#memory_$Pointer$.offset)| .cse1 .cse0))) (let ((.cse9 (@diff .cse11 |c_#memory_$Pointer$.offset|))) (let ((.cse10 (select |c_#memory_$Pointer$.offset| .cse9))) (let ((.cse4 (store .cse11 .cse9 .cse10))) (let ((.cse2 (@diff .cse4 |c_#memory_$Pointer$.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse7 (select |c_old(#valid)| |c_node_create_#res#1.base|)) (.cse5 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (and (exists ((v_ArrVal_5915 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_5915))) (exists ((v_arrayElimArr_2 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_arrayElimArr_2)) (= (select v_arrayElimArr_2 4) 0))) (= |c_node_create_#res#1.offset| 0) (or (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|) (and (= (select .cse0 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse1) 0) 0))) (or (and (= (select (select |c_#memory_$Pointer$.base| .cse2) 0) 0) (= (select .cse3 0) 0)) (= .cse4 |c_#memory_$Pointer$.offset|)) (= (store |c_old(#memory_$Pointer$.base)| .cse5 (select |c_#memory_$Pointer$.base| .cse5)) |c_#memory_$Pointer$.base|) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (and (< v_arrayElimIndex_49 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1))) (= 0 .cse7) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse8 (select |v_#valid_BEFORE_CALL_44| .cse8))) |v_#valid_BEFORE_CALL_44|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= (store .cse4 .cse2 .cse3) |c_#memory_$Pointer$.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|) 0) 0) (or (and (= (select (select |c_#memory_$Pointer$.base| .cse9) 0) 0) (= (select .cse10 0) 0)) (= .cse11 |c_#memory_$Pointer$.offset|)) (not (= 0 |c_node_create_#res#1.base|)) (= .cse7 0) (or (= .cse5 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (let ((.cse12 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse12 (select |c_#valid| .cse12))) |c_#valid|)))))))))) is different from true [2023-02-16 03:45:06,237 WARN L837 $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 ((.cse10 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse5 (+ .cse6 2)) (.cse7 (select .cse10 0)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) .cse0 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse1 (+ v_arrayElimIndex_49 2))) (and (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse4 (select |v_#valid_BEFORE_CALL_45| .cse4))) |v_#valid_BEFORE_CALL_45|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (= (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_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse7) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse6 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse8 (select |v_#valid_BEFORE_CALL_48| .cse8))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse7) 1))) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse9 (= (select .cse10 4) .cse7) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (= .cse11 0) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse11))) (let ((.cse12 (select .cse13 4))) (and (not (= .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse12)) .cse0 (not (= .cse12 .cse11)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse11)) (= (select .cse13 0) .cse12) .cse9))))))))) is different from false [2023-02-16 03:45:06,241 WARN L859 $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 ((.cse10 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse5 (+ .cse6 2)) (.cse7 (select .cse10 0)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) .cse0 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse1 (+ v_arrayElimIndex_49 2))) (and (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse3 (select |v_#valid_BEFORE_CALL_44| .cse3))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse4 (select |v_#valid_BEFORE_CALL_45| .cse4))) |v_#valid_BEFORE_CALL_45|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (= (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_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse7) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse6 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse8 (select |v_#valid_BEFORE_CALL_48| .cse8))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse7) 1))) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse9 (= (select .cse10 4) .cse7) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (= .cse11 0) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse11))) (let ((.cse12 (select .cse13 4))) (and (not (= .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse12)) .cse0 (not (= .cse12 .cse11)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse11)) (= (select .cse13 0) .cse12) .cse9))))))))) is different from true [2023-02-16 03:45:06,309 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse3 (select .cse7 0)) (.cse1 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse5 (+ .cse2 2))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse3) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse6 (= (select .cse7 4) .cse3) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (= .cse8 0) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse9 (select .cse10 4))) (and (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse9)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) .cse1 (not (= .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= .cse9 .cse8)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (= (select .cse10 0) .cse9) .cse6))))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse11 (+ v_arrayElimIndex_49 2))) (and (<= .cse11 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse12 (select |v_#valid_BEFORE_CALL_44| .cse12))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse13 (select |v_#valid_BEFORE_CALL_45| .cse13))) |v_#valid_BEFORE_CALL_45|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse11 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))))) is different from false [2023-02-16 03:45:06,314 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse3 (select .cse7 0)) (.cse1 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse5 (+ .cse2 2))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse3) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse6 (= (select .cse7 4) .cse3) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (= .cse8 0) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse9 (select .cse10 4))) (and (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse9)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) .cse1 (not (= .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= .cse9 .cse8)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (= (select .cse10 0) .cse9) .cse6))))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse11 (+ v_arrayElimIndex_49 2))) (and (<= .cse11 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse12 (select |v_#valid_BEFORE_CALL_44| .cse12))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse13 (select |v_#valid_BEFORE_CALL_45| .cse13))) |v_#valid_BEFORE_CALL_45|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse11 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))))) is different from true [2023-02-16 03:45:06,372 WARN L837 $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 ((.cse10 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (select .cse10 0)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse9 (+ .cse6 2))) (and (or (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse0 (select .cse3 4))) (and (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) .cse1 (not (= .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= .cse0 .cse2)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (= (select .cse3 0) .cse0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) .cse4)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.base| 0)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.offset| 0) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse7) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse6 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse8 (select |v_#valid_BEFORE_CALL_48| .cse8))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse7) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse4 (= (select .cse10 4) .cse7) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse11 (+ v_arrayElimIndex_49 2))) (and (<= .cse11 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse12 (select |v_#valid_BEFORE_CALL_44| .cse12))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse13 (select |v_#valid_BEFORE_CALL_45| .cse13))) |v_#valid_BEFORE_CALL_45|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse11 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))))) is different from false [2023-02-16 03:45:06,377 WARN L859 $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 ((.cse10 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (select .cse10 0)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse9 (+ .cse6 2))) (and (or (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse0 (select .cse3 4))) (and (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse0)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) .cse1 (not (= .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= .cse0 .cse2)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (= (select .cse3 0) .cse0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) .cse4)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.base| 0)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.offset| 0) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse7) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse6 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse8 (select |v_#valid_BEFORE_CALL_48| .cse8))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse7) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse4 (= (select .cse10 4) .cse7) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse11 (+ v_arrayElimIndex_49 2))) (and (<= .cse11 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse12 (select |v_#valid_BEFORE_CALL_44| .cse12))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse13 (select |v_#valid_BEFORE_CALL_45| .cse13))) |v_#valid_BEFORE_CALL_45|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse11 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))))) is different from true [2023-02-16 03:45:06,426 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse4)) (.cse9 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse6 (select .cse9 0)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (select .cse0 4)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse8 (+ .cse5 2))) (and (= (select .cse0 .cse1) .cse2) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse6) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse7 (select |v_#valid_BEFORE_CALL_48| .cse7))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse6) 1))) (= (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_circular_append_~head#1.base| .cse4)) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse9 4) .cse6) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (= .cse1 0) (not (= .cse2 .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse10 (+ v_arrayElimIndex_49 2))) (and (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse12 (select |v_#valid_BEFORE_CALL_45| .cse12))) |v_#valid_BEFORE_CALL_45|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse10 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))))) is different from false [2023-02-16 03:45:06,431 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse4)) (.cse9 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse6 (select .cse9 0)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (select .cse0 4)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse8 (+ .cse5 2))) (and (= (select .cse0 .cse1) .cse2) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse6) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse7 (select |v_#valid_BEFORE_CALL_48| .cse7))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse6) 1))) (= (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_circular_append_~head#1.base| .cse4)) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse9 4) .cse6) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (= .cse1 0) (not (= .cse2 .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse10 (+ v_arrayElimIndex_49 2))) (and (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse12 (select |v_#valid_BEFORE_CALL_45| .cse12))) |v_#valid_BEFORE_CALL_45|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse10 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))))) is different from true [2023-02-16 03:45:06,495 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|)) (.cse8 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse2 (select .cse8 0)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (select .cse9 (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse7 (+ .cse1 2)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse3 (select |v_#valid_BEFORE_CALL_48| .cse3))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse2) 1))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| .cse4) (= (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_circular_append_~head#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse8 4) .cse2) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse6 |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (= .cse4 0) (= (select .cse9 .cse4) .cse6) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse10 (+ v_arrayElimIndex_49 2))) (and (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse12 (select |v_#valid_BEFORE_CALL_45| .cse12))) |v_#valid_BEFORE_CALL_45|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse10 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (= .cse5 |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse5))))) is different from false [2023-02-16 03:45:06,500 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|)) (.cse8 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse2 (select .cse8 0)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (select .cse9 (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse7 (+ .cse1 2)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse3 (select |v_#valid_BEFORE_CALL_48| .cse3))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse2) 1))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| .cse4) (= (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_circular_append_~head#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse8 4) .cse2) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse6 |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (= .cse4 0) (= (select .cse9 .cse4) .cse6) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse10 (+ v_arrayElimIndex_49 2))) (and (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse11 (select |v_#valid_BEFORE_CALL_44| .cse11))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse12 (select |v_#valid_BEFORE_CALL_45| .cse12))) |v_#valid_BEFORE_CALL_45|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse10 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (= .cse5 |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse5))))) is different from true [2023-02-16 03:45:06,567 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse8 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse4 (select .cse8 0)) (.cse0 (select |c_#memory_$Pointer$.base| .cse6)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse7 (+ .cse3 2))) (and (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select .cse0 (+ .cse1 4))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse4) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse3 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse5 (select |v_#valid_BEFORE_CALL_48| .cse5))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse4) 1))) (= (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_circular_append_~head#1.base| .cse6)) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse8 4) .cse4) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (= .cse1 0) (= (select .cse0 .cse1) |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse9 (+ v_arrayElimIndex_49 2))) (and (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse11 (select |v_#valid_BEFORE_CALL_45| .cse11))) |v_#valid_BEFORE_CALL_45|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| .cse6)))))) is different from false [2023-02-16 03:45:06,572 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse8 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse4 (select .cse8 0)) (.cse0 (select |c_#memory_$Pointer$.base| .cse6)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse7 (+ .cse3 2))) (and (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select .cse0 (+ .cse1 4))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse4) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse3 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse5 (select |v_#valid_BEFORE_CALL_48| .cse5))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse4) 1))) (= (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_circular_append_~head#1.base| .cse6)) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse8 4) .cse4) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (= .cse1 0) (= (select .cse0 .cse1) |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse9 (+ v_arrayElimIndex_49 2))) (and (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse11 (select |v_#valid_BEFORE_CALL_45| .cse11))) |v_#valid_BEFORE_CALL_45|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| .cse6)))))) is different from true [2023-02-16 03:45:06,635 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse8 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse5 (select .cse8 0)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse7 (+ .cse4 2)) (.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (not (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| .cse0)) (not (= .cse0 (select .cse1 .cse2))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse4)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse5) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse4 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse6 (select |v_#valid_BEFORE_CALL_48| .cse6))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1))) (= (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_circular_append_~head#1.base| .cse0)) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse8 4) .cse5) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (= .cse2 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse9 (+ v_arrayElimIndex_49 2))) (and (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse11 (select |v_#valid_BEFORE_CALL_45| .cse11))) |v_#valid_BEFORE_CALL_45|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select .cse1 (+ .cse2 4))))))) is different from false [2023-02-16 03:45:06,639 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse8 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse5 (select .cse8 0)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse7 (+ .cse4 2)) (.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (not (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| .cse0)) (not (= .cse0 (select .cse1 .cse2))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse4)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse5) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse4 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse6 (select |v_#valid_BEFORE_CALL_48| .cse6))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1))) (= (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_circular_append_~head#1.base| .cse0)) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse8 4) .cse5) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (= .cse2 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse9 (+ v_arrayElimIndex_49 2))) (and (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse11 (select |v_#valid_BEFORE_CALL_45| .cse11))) |v_#valid_BEFORE_CALL_45|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select .cse1 (+ .cse2 4))))))) is different from true [2023-02-16 03:45:06,679 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse12 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse1 (select .cse12 4)) (.cse3 (select .cse12 0)) (.cse5 (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (+ .cse2 2))) (and (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (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.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse3) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse5)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 .cse3) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (= (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse5) (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse9 (+ v_arrayElimIndex_49 2))) (and (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse11 (select |v_#valid_BEFORE_CALL_45| .cse11))) |v_#valid_BEFORE_CALL_45|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))))) is different from false [2023-02-16 03:45:06,683 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse12 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse1 (select .cse12 4)) (.cse3 (select .cse12 0)) (.cse5 (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (+ .cse2 2))) (and (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (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.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse3) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse5)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 .cse3) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (= (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse5) (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse9 (+ v_arrayElimIndex_49 2))) (and (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse11 (select |v_#valid_BEFORE_CALL_45| .cse11))) |v_#valid_BEFORE_CALL_45|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))))) is different from true [2023-02-16 03:45:06,745 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse12 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse1 (select .cse12 4)) (.cse3 (select .cse12 0)) (.cse5 (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (+ .cse2 2))) (and (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (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.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse3) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse5)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 .cse3) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (= (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse5) (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse9 (+ v_arrayElimIndex_49 2))) (and (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse11 (select |v_#valid_BEFORE_CALL_45| .cse11))) |v_#valid_BEFORE_CALL_45|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))))) is different from false [2023-02-16 03:45:06,750 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse12 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse1 (select .cse12 4)) (.cse3 (select .cse12 0)) (.cse5 (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (+ .cse2 2))) (and (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (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.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse3) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse5)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 .cse3) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (= (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse5) (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse9 (+ v_arrayElimIndex_49 2))) (and (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse11 (select |v_#valid_BEFORE_CALL_45| .cse11))) |v_#valid_BEFORE_CALL_45|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))))) is different from true [2023-02-16 03:45:06,809 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse12 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse1 (select .cse12 4)) (.cse3 (select .cse12 0)) (.cse5 (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (+ .cse2 2))) (and (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (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.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse3) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse5)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 .cse3) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse5) (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse9 (+ v_arrayElimIndex_49 2))) (and (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse11 (select |v_#valid_BEFORE_CALL_45| .cse11))) |v_#valid_BEFORE_CALL_45|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))))) is different from false [2023-02-16 03:45:06,813 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse12 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse1 (select .cse12 4)) (.cse3 (select .cse12 0)) (.cse5 (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (+ .cse2 2))) (and (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (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.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse3) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse5)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 .cse3) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse5) (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse9 (+ v_arrayElimIndex_49 2))) (and (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse10 (select |v_#valid_BEFORE_CALL_44| .cse10))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse11 (select |v_#valid_BEFORE_CALL_45| .cse11))) |v_#valid_BEFORE_CALL_45|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))))) is different from true [2023-02-16 03:45:06,883 WARN L837 $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 ((.cse10 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse3 (select .cse10 4)) (.cse4 (select .cse10 0)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (+ .cse0 2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) .cse1))) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 0) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse4) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse5 (select |v_#valid_BEFORE_CALL_48| .cse5))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse4) 1))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse3 .cse4) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse7 (+ v_arrayElimIndex_49 2))) (and (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse8 (select |v_#valid_BEFORE_CALL_44| .cse8))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse9 (select |v_#valid_BEFORE_CALL_45| .cse9))) |v_#valid_BEFORE_CALL_45|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (not (= (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) .cse1)) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset|))))) is different from false [2023-02-16 03:45:06,888 WARN L859 $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 ((.cse10 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse3 (select .cse10 4)) (.cse4 (select .cse10 0)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (+ .cse0 2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) .cse1))) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 0) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse4) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse5 (select |v_#valid_BEFORE_CALL_48| .cse5))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse4) 1))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse3 .cse4) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse7 (+ v_arrayElimIndex_49 2))) (and (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse8 (select |v_#valid_BEFORE_CALL_44| .cse8))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse9 (select |v_#valid_BEFORE_CALL_45| .cse9))) |v_#valid_BEFORE_CALL_45|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (not (= (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) .cse1)) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset|))))) is different from true [2023-02-16 03:45:08,895 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (+ .cse3 2)) (.cse21 (select |c_#memory_$Pointer$.base| .cse3)) (.cse22 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse2 (select .cse21 4)) (.cse5 (select .cse21 0)) (.cse1 (= .cse22 0))) (or (let ((.cse0 (+ .cse5 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_48| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse3 1) .cse5)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse6 (+ v_arrayElimIndex_49 2))) (and (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_45| .cse8))) |v_#valid_BEFORE_CALL_45|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))) (and (or (let ((.cse11 (+ .cse2 2))) (and (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse5) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse3 1) .cse2)) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse10 (select |v_#valid_BEFORE_CALL_48| .cse10))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1))) (<= .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse12 (+ v_arrayElimIndex_49 2))) (and (<= .cse12 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse13 (select |v_#valid_BEFORE_CALL_44| .cse13))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse14 (select |v_#valid_BEFORE_CALL_45| .cse14))) |v_#valid_BEFORE_CALL_45|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse11 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse11 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse12 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_267 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimIndex_49 Int)) (let ((.cse19 (select .cse21 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimIndex_49 2)) (.cse16 (+ .cse19 2))) (and (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse16 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse17 (select |v_#valid_BEFORE_CALL_44| .cse17))) |v_#valid_BEFORE_CALL_44|) (<= .cse16 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse18 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse18 (select |v_#valid_BEFORE_CALL_45| .cse18))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse3)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse3 1) .cse19)) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse20 (select |v_#valid_BEFORE_CALL_48| .cse20))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse5) 0) (<= .cse15 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse5))) .cse1))) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse3 (select .cse21 .cse22)))))) is different from false [2023-02-16 03:45:08,902 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (+ .cse3 2)) (.cse21 (select |c_#memory_$Pointer$.base| .cse3)) (.cse22 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse2 (select .cse21 4)) (.cse5 (select .cse21 0)) (.cse1 (= .cse22 0))) (or (let ((.cse0 (+ .cse5 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_48| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse3 1) .cse5)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse6 (+ v_arrayElimIndex_49 2))) (and (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_45| .cse8))) |v_#valid_BEFORE_CALL_45|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))) (and (or (let ((.cse11 (+ .cse2 2))) (and (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse5) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse3 1) .cse2)) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse10 (select |v_#valid_BEFORE_CALL_48| .cse10))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1))) (<= .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse12 (+ v_arrayElimIndex_49 2))) (and (<= .cse12 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse13 (select |v_#valid_BEFORE_CALL_44| .cse13))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse14 (select |v_#valid_BEFORE_CALL_45| .cse14))) |v_#valid_BEFORE_CALL_45|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse11 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse11 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse12 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_267 Int) (|v_#valid_BEFORE_CALL_48| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimIndex_49 Int)) (let ((.cse19 (select .cse21 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimIndex_49 2)) (.cse16 (+ .cse19 2))) (and (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse16 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse17 (select |v_#valid_BEFORE_CALL_44| .cse17))) |v_#valid_BEFORE_CALL_44|) (<= .cse16 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse18 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse18 (select |v_#valid_BEFORE_CALL_45| .cse18))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse3)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse3 1) .cse19)) (= (select |v_#valid_BEFORE_CALL_48| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse20 (select |v_#valid_BEFORE_CALL_48| .cse20))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse5) 0) (<= .cse15 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse5))) .cse1))) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse3 (select .cse21 .cse22)))))) is different from true [2023-02-16 03:45:10,910 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (+ .cse3 2))) (and (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse1 (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0)) (.cse2 (select .cse21 4)) (.cse5 (select .cse21 0))) (or (let ((.cse0 (+ .cse5 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_48| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse3 1) .cse5)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse6 (+ v_arrayElimIndex_49 2))) (and (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_45| .cse8))) |v_#valid_BEFORE_CALL_45|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))) (and .cse1 (or (let ((.cse12 (+ .cse2 2))) (and (exists ((v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_140 Int) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse10 (+ v_prenex_140 2))) (and (not (= 0 v_prenex_132)) (= (select v_prenex_136 v_prenex_139) 1) (<= .cse10 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (<= .cse9 v_prenex_132) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse11 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse11 (select v_prenex_138 .cse11))) v_prenex_138) (<= .cse12 v_prenex_137) (not (= 0 v_prenex_137)) (= (let ((.cse13 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse13 (select v_prenex_136 .cse13))) v_prenex_136) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse10 v_prenex_137) (<= .cse12 v_prenex_132) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_131 v_prenex_139) 0) (= (select v_prenex_133 v_prenex_132) 1) (<= .cse9 v_prenex_137) (= (select v_prenex_133 v_prenex_134) 0)))) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_135 (Array Int Int))) (and (= 0 (select v_prenex_141 .cse3)) (= (select v_prenex_141 .cse5) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse14 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse14 (select v_prenex_141 .cse14))) v_prenex_141) (= (select v_prenex_135 .cse5) 0) (= 0 (select (store v_prenex_141 .cse3 1) .cse2)))) (<= .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_prenex_150 (Array Int Int)) (v_prenex_151 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_144 (Array Int Int)) (v_prenex_145 (Array Int Int)) (v_prenex_147 (Array Int Int)) (v_prenex_149 (Array Int Int)) (v_prenex_148 Int) (v_prenex_146 Int) (v_prenex_143 Int) (v_prenex_152 Int) (v_prenex_142 Int)) (let ((.cse19 (select .cse21 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse16 (+ v_prenex_152 2)) (.cse15 (+ .cse19 2))) (and (<= .cse15 v_prenex_146) (= 0 (select v_prenex_150 v_prenex_152)) (= (select v_prenex_144 .cse5) 1) (<= .cse9 v_prenex_146) (= (select v_prenex_151 v_prenex_148) 1) (<= .cse16 v_prenex_142) (not (= 0 v_prenex_146)) (<= .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse15 v_prenex_142) (= (let ((.cse17 (@diff v_prenex_147 v_prenex_151))) (store v_prenex_147 .cse17 (select v_prenex_151 .cse17))) v_prenex_151) (<= .cse9 v_prenex_142) (= 0 (select v_prenex_144 .cse3)) (= (let ((.cse18 (@diff v_prenex_149 v_prenex_144))) (store v_prenex_149 .cse18 (select v_prenex_144 .cse18))) v_prenex_144) (= (select v_prenex_145 v_prenex_143) 0) (= (select v_prenex_150 v_prenex_143) 1) (not (= 0 v_prenex_142)) (= (select v_prenex_149 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_149 .cse5) 0) (= (select v_prenex_145 v_prenex_142) 1) (<= .cse16 v_prenex_146) (<= .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select (store v_prenex_144 .cse3 1) .cse19)) (= (select v_prenex_147 v_prenex_148) 0) (= (select v_prenex_147 v_prenex_146) 1) (= (let ((.cse20 (@diff v_prenex_145 v_prenex_150))) (store v_prenex_145 .cse20 (select v_prenex_150 .cse20))) v_prenex_150))))) (= .cse2 .cse5))))))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem16#1.base|) |c_ULTIMATE.start_main_#t~mem16#1.offset|))) (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse3) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-16 03:45:10,920 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (+ .cse3 2))) (and (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse1 (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0)) (.cse2 (select .cse21 4)) (.cse5 (select .cse21 0))) (or (let ((.cse0 (+ .cse5 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_48| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse3 1) .cse5)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse6 (+ v_arrayElimIndex_49 2))) (and (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_45| .cse8))) |v_#valid_BEFORE_CALL_45|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))) (and .cse1 (or (let ((.cse12 (+ .cse2 2))) (and (exists ((v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_140 Int) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse10 (+ v_prenex_140 2))) (and (not (= 0 v_prenex_132)) (= (select v_prenex_136 v_prenex_139) 1) (<= .cse10 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (<= .cse9 v_prenex_132) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse11 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse11 (select v_prenex_138 .cse11))) v_prenex_138) (<= .cse12 v_prenex_137) (not (= 0 v_prenex_137)) (= (let ((.cse13 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse13 (select v_prenex_136 .cse13))) v_prenex_136) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse10 v_prenex_137) (<= .cse12 v_prenex_132) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_131 v_prenex_139) 0) (= (select v_prenex_133 v_prenex_132) 1) (<= .cse9 v_prenex_137) (= (select v_prenex_133 v_prenex_134) 0)))) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_135 (Array Int Int))) (and (= 0 (select v_prenex_141 .cse3)) (= (select v_prenex_141 .cse5) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse14 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse14 (select v_prenex_141 .cse14))) v_prenex_141) (= (select v_prenex_135 .cse5) 0) (= 0 (select (store v_prenex_141 .cse3 1) .cse2)))) (<= .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_prenex_150 (Array Int Int)) (v_prenex_151 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_144 (Array Int Int)) (v_prenex_145 (Array Int Int)) (v_prenex_147 (Array Int Int)) (v_prenex_149 (Array Int Int)) (v_prenex_148 Int) (v_prenex_146 Int) (v_prenex_143 Int) (v_prenex_152 Int) (v_prenex_142 Int)) (let ((.cse19 (select .cse21 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse16 (+ v_prenex_152 2)) (.cse15 (+ .cse19 2))) (and (<= .cse15 v_prenex_146) (= 0 (select v_prenex_150 v_prenex_152)) (= (select v_prenex_144 .cse5) 1) (<= .cse9 v_prenex_146) (= (select v_prenex_151 v_prenex_148) 1) (<= .cse16 v_prenex_142) (not (= 0 v_prenex_146)) (<= .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse15 v_prenex_142) (= (let ((.cse17 (@diff v_prenex_147 v_prenex_151))) (store v_prenex_147 .cse17 (select v_prenex_151 .cse17))) v_prenex_151) (<= .cse9 v_prenex_142) (= 0 (select v_prenex_144 .cse3)) (= (let ((.cse18 (@diff v_prenex_149 v_prenex_144))) (store v_prenex_149 .cse18 (select v_prenex_144 .cse18))) v_prenex_144) (= (select v_prenex_145 v_prenex_143) 0) (= (select v_prenex_150 v_prenex_143) 1) (not (= 0 v_prenex_142)) (= (select v_prenex_149 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_149 .cse5) 0) (= (select v_prenex_145 v_prenex_142) 1) (<= .cse16 v_prenex_146) (<= .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select (store v_prenex_144 .cse3 1) .cse19)) (= (select v_prenex_147 v_prenex_148) 0) (= (select v_prenex_147 v_prenex_146) 1) (= (let ((.cse20 (@diff v_prenex_145 v_prenex_150))) (store v_prenex_145 .cse20 (select v_prenex_150 .cse20))) v_prenex_150))))) (= .cse2 .cse5))))))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem16#1.base|) |c_ULTIMATE.start_main_#t~mem16#1.offset|))) (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse3) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-16 03:45:12,927 WARN L837 $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 ((.cse9 (+ .cse0 2))) (and (not (= .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0)) (.cse3 (select .cse21 4)) (.cse5 (select .cse21 0))) (or (let ((.cse1 (+ .cse5 2))) (and (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse2 (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse3) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse5)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse6 (+ v_arrayElimIndex_49 2))) (and (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_45| .cse8))) |v_#valid_BEFORE_CALL_45|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))) (and .cse2 (or (let ((.cse12 (+ .cse3 2))) (and (exists ((v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_140 Int) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse10 (+ v_prenex_140 2))) (and (not (= 0 v_prenex_132)) (= (select v_prenex_136 v_prenex_139) 1) (<= .cse10 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (<= .cse9 v_prenex_132) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse11 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse11 (select v_prenex_138 .cse11))) v_prenex_138) (<= .cse12 v_prenex_137) (not (= 0 v_prenex_137)) (= (let ((.cse13 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse13 (select v_prenex_136 .cse13))) v_prenex_136) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse10 v_prenex_137) (<= .cse12 v_prenex_132) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_131 v_prenex_139) 0) (= (select v_prenex_133 v_prenex_132) 1) (<= .cse9 v_prenex_137) (= (select v_prenex_133 v_prenex_134) 0)))) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_135 (Array Int Int))) (and (= 0 (select v_prenex_141 .cse0)) (= (select v_prenex_141 .cse5) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse14 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse14 (select v_prenex_141 .cse14))) v_prenex_141) (= (select v_prenex_135 .cse5) 0) (= 0 (select (store v_prenex_141 .cse0 1) .cse3)))) (<= .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_prenex_150 (Array Int Int)) (v_prenex_151 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_144 (Array Int Int)) (v_prenex_145 (Array Int Int)) (v_prenex_147 (Array Int Int)) (v_prenex_149 (Array Int Int)) (v_prenex_148 Int) (v_prenex_146 Int) (v_prenex_143 Int) (v_prenex_152 Int) (v_prenex_142 Int)) (let ((.cse19 (select .cse21 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse16 (+ v_prenex_152 2)) (.cse15 (+ .cse19 2))) (and (<= .cse15 v_prenex_146) (= 0 (select v_prenex_150 v_prenex_152)) (= (select v_prenex_144 .cse5) 1) (<= .cse9 v_prenex_146) (= (select v_prenex_151 v_prenex_148) 1) (<= .cse16 v_prenex_142) (not (= 0 v_prenex_146)) (<= .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse15 v_prenex_142) (= (let ((.cse17 (@diff v_prenex_147 v_prenex_151))) (store v_prenex_147 .cse17 (select v_prenex_151 .cse17))) v_prenex_151) (<= .cse9 v_prenex_142) (= 0 (select v_prenex_144 .cse0)) (= (let ((.cse18 (@diff v_prenex_149 v_prenex_144))) (store v_prenex_149 .cse18 (select v_prenex_144 .cse18))) v_prenex_144) (= (select v_prenex_145 v_prenex_143) 0) (= (select v_prenex_150 v_prenex_143) 1) (not (= 0 v_prenex_142)) (= (select v_prenex_149 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_149 .cse5) 0) (= (select v_prenex_145 v_prenex_142) 1) (<= .cse16 v_prenex_146) (<= .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select (store v_prenex_144 .cse0 1) .cse19)) (= (select v_prenex_147 v_prenex_148) 0) (= (select v_prenex_147 v_prenex_146) 1) (= (let ((.cse20 (@diff v_prenex_145 v_prenex_150))) (store v_prenex_145 .cse20 (select v_prenex_150 .cse20))) v_prenex_150))))) (= .cse3 .cse5))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-16 03:45:12,938 WARN L859 $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 ((.cse9 (+ .cse0 2))) (and (not (= .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0)) (.cse3 (select .cse21 4)) (.cse5 (select .cse21 0))) (or (let ((.cse1 (+ .cse5 2))) (and (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse2 (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_48| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse4 (select |v_#valid_BEFORE_CALL_48| .cse4))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse3) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse5)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse6 (+ v_arrayElimIndex_49 2))) (and (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_45| .cse8))) |v_#valid_BEFORE_CALL_45|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))) (and .cse2 (or (let ((.cse12 (+ .cse3 2))) (and (exists ((v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_140 Int) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse10 (+ v_prenex_140 2))) (and (not (= 0 v_prenex_132)) (= (select v_prenex_136 v_prenex_139) 1) (<= .cse10 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (<= .cse9 v_prenex_132) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse11 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse11 (select v_prenex_138 .cse11))) v_prenex_138) (<= .cse12 v_prenex_137) (not (= 0 v_prenex_137)) (= (let ((.cse13 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse13 (select v_prenex_136 .cse13))) v_prenex_136) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse10 v_prenex_137) (<= .cse12 v_prenex_132) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_131 v_prenex_139) 0) (= (select v_prenex_133 v_prenex_132) 1) (<= .cse9 v_prenex_137) (= (select v_prenex_133 v_prenex_134) 0)))) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_135 (Array Int Int))) (and (= 0 (select v_prenex_141 .cse0)) (= (select v_prenex_141 .cse5) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse14 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse14 (select v_prenex_141 .cse14))) v_prenex_141) (= (select v_prenex_135 .cse5) 0) (= 0 (select (store v_prenex_141 .cse0 1) .cse3)))) (<= .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_prenex_150 (Array Int Int)) (v_prenex_151 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_144 (Array Int Int)) (v_prenex_145 (Array Int Int)) (v_prenex_147 (Array Int Int)) (v_prenex_149 (Array Int Int)) (v_prenex_148 Int) (v_prenex_146 Int) (v_prenex_143 Int) (v_prenex_152 Int) (v_prenex_142 Int)) (let ((.cse19 (select .cse21 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse16 (+ v_prenex_152 2)) (.cse15 (+ .cse19 2))) (and (<= .cse15 v_prenex_146) (= 0 (select v_prenex_150 v_prenex_152)) (= (select v_prenex_144 .cse5) 1) (<= .cse9 v_prenex_146) (= (select v_prenex_151 v_prenex_148) 1) (<= .cse16 v_prenex_142) (not (= 0 v_prenex_146)) (<= .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse15 v_prenex_142) (= (let ((.cse17 (@diff v_prenex_147 v_prenex_151))) (store v_prenex_147 .cse17 (select v_prenex_151 .cse17))) v_prenex_151) (<= .cse9 v_prenex_142) (= 0 (select v_prenex_144 .cse0)) (= (let ((.cse18 (@diff v_prenex_149 v_prenex_144))) (store v_prenex_149 .cse18 (select v_prenex_144 .cse18))) v_prenex_144) (= (select v_prenex_145 v_prenex_143) 0) (= (select v_prenex_150 v_prenex_143) 1) (not (= 0 v_prenex_142)) (= (select v_prenex_149 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_149 .cse5) 0) (= (select v_prenex_145 v_prenex_142) 1) (<= .cse16 v_prenex_146) (<= .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select (store v_prenex_144 .cse0 1) .cse19)) (= (select v_prenex_147 v_prenex_148) 0) (= (select v_prenex_147 v_prenex_146) 1) (= (let ((.cse20 (@diff v_prenex_145 v_prenex_150))) (store v_prenex_145 .cse20 (select v_prenex_150 .cse20))) v_prenex_150))))) (= .cse3 .cse5))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-16 03:45:14,947 WARN L837 $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 ((.cse3 (+ .cse0 2))) (and (not (= .cse0 |c_ULTIMATE.start_main_#t~mem19#1.base|)) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse16 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse7 (select .cse16 0))) (let ((.cse1 (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse7)) (.cse9 (select .cse16 4))) (or (and .cse1 (or (let ((.cse5 (+ .cse9 2))) (and (exists ((v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_140 Int) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse2 (+ v_prenex_140 2))) (and (not (= 0 v_prenex_132)) (= (select v_prenex_136 v_prenex_139) 1) (<= .cse2 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (<= .cse3 v_prenex_132) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse4 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse4 (select v_prenex_138 .cse4))) v_prenex_138) (<= .cse5 v_prenex_137) (not (= 0 v_prenex_137)) (= (let ((.cse6 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse6 (select v_prenex_136 .cse6))) v_prenex_136) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 v_prenex_137) (<= .cse5 v_prenex_132) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_131 v_prenex_139) 0) (= (select v_prenex_133 v_prenex_132) 1) (<= .cse3 v_prenex_137) (= (select v_prenex_133 v_prenex_134) 0)))) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_135 (Array Int Int))) (and (= 0 (select v_prenex_141 .cse0)) (= (select v_prenex_141 .cse7) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse8 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse8 (select v_prenex_141 .cse8))) v_prenex_141) (= (select v_prenex_135 .cse7) 0) (= 0 (select (store v_prenex_141 .cse0 1) .cse9)))) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_prenex_150 (Array Int Int)) (v_prenex_151 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_144 (Array Int Int)) (v_prenex_145 (Array Int Int)) (v_prenex_147 (Array Int Int)) (v_prenex_149 (Array Int Int)) (v_prenex_148 Int) (v_prenex_146 Int) (v_prenex_143 Int) (v_prenex_152 Int) (v_prenex_142 Int)) (let ((.cse14 (select .cse16 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse11 (+ v_prenex_152 2)) (.cse10 (+ .cse14 2))) (and (<= .cse10 v_prenex_146) (= 0 (select v_prenex_150 v_prenex_152)) (= (select v_prenex_144 .cse7) 1) (<= .cse3 v_prenex_146) (= (select v_prenex_151 v_prenex_148) 1) (<= .cse11 v_prenex_142) (not (= 0 v_prenex_146)) (<= .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse10 v_prenex_142) (= (let ((.cse12 (@diff v_prenex_147 v_prenex_151))) (store v_prenex_147 .cse12 (select v_prenex_151 .cse12))) v_prenex_151) (<= .cse3 v_prenex_142) (= 0 (select v_prenex_144 .cse0)) (= (let ((.cse13 (@diff v_prenex_149 v_prenex_144))) (store v_prenex_149 .cse13 (select v_prenex_144 .cse13))) v_prenex_144) (= (select v_prenex_145 v_prenex_143) 0) (= (select v_prenex_150 v_prenex_143) 1) (not (= 0 v_prenex_142)) (= (select v_prenex_149 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_149 .cse7) 0) (= (select v_prenex_145 v_prenex_142) 1) (<= .cse11 v_prenex_146) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select (store v_prenex_144 .cse0 1) .cse14)) (= (select v_prenex_147 v_prenex_148) 0) (= (select v_prenex_147 v_prenex_146) 1) (= (let ((.cse15 (@diff v_prenex_145 v_prenex_150))) (store v_prenex_145 .cse15 (select v_prenex_150 .cse15))) v_prenex_150))))) (= .cse9 .cse7)))) (let ((.cse17 (+ .cse7 2))) (and .cse1 (<= .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_48| .cse9) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse18 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse18 (select |v_#valid_BEFORE_CALL_48| .cse18))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse9) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse7)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse19 (+ v_arrayElimIndex_49 2))) (and (<= .cse19 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse20 (select |v_#valid_BEFORE_CALL_44| .cse20))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse21 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse21 (select |v_#valid_BEFORE_CALL_45| .cse21))) |v_#valid_BEFORE_CALL_45|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse17 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse17 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse19 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))))))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-16 03:45:14,958 WARN L859 $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 ((.cse3 (+ .cse0 2))) (and (not (= .cse0 |c_ULTIMATE.start_main_#t~mem19#1.base|)) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse16 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse7 (select .cse16 0))) (let ((.cse1 (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse7)) (.cse9 (select .cse16 4))) (or (and .cse1 (or (let ((.cse5 (+ .cse9 2))) (and (exists ((v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_140 Int) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse2 (+ v_prenex_140 2))) (and (not (= 0 v_prenex_132)) (= (select v_prenex_136 v_prenex_139) 1) (<= .cse2 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (<= .cse3 v_prenex_132) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse4 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse4 (select v_prenex_138 .cse4))) v_prenex_138) (<= .cse5 v_prenex_137) (not (= 0 v_prenex_137)) (= (let ((.cse6 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse6 (select v_prenex_136 .cse6))) v_prenex_136) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 v_prenex_137) (<= .cse5 v_prenex_132) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_131 v_prenex_139) 0) (= (select v_prenex_133 v_prenex_132) 1) (<= .cse3 v_prenex_137) (= (select v_prenex_133 v_prenex_134) 0)))) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_135 (Array Int Int))) (and (= 0 (select v_prenex_141 .cse0)) (= (select v_prenex_141 .cse7) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse8 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse8 (select v_prenex_141 .cse8))) v_prenex_141) (= (select v_prenex_135 .cse7) 0) (= 0 (select (store v_prenex_141 .cse0 1) .cse9)))) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_prenex_150 (Array Int Int)) (v_prenex_151 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_144 (Array Int Int)) (v_prenex_145 (Array Int Int)) (v_prenex_147 (Array Int Int)) (v_prenex_149 (Array Int Int)) (v_prenex_148 Int) (v_prenex_146 Int) (v_prenex_143 Int) (v_prenex_152 Int) (v_prenex_142 Int)) (let ((.cse14 (select .cse16 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse11 (+ v_prenex_152 2)) (.cse10 (+ .cse14 2))) (and (<= .cse10 v_prenex_146) (= 0 (select v_prenex_150 v_prenex_152)) (= (select v_prenex_144 .cse7) 1) (<= .cse3 v_prenex_146) (= (select v_prenex_151 v_prenex_148) 1) (<= .cse11 v_prenex_142) (not (= 0 v_prenex_146)) (<= .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse10 v_prenex_142) (= (let ((.cse12 (@diff v_prenex_147 v_prenex_151))) (store v_prenex_147 .cse12 (select v_prenex_151 .cse12))) v_prenex_151) (<= .cse3 v_prenex_142) (= 0 (select v_prenex_144 .cse0)) (= (let ((.cse13 (@diff v_prenex_149 v_prenex_144))) (store v_prenex_149 .cse13 (select v_prenex_144 .cse13))) v_prenex_144) (= (select v_prenex_145 v_prenex_143) 0) (= (select v_prenex_150 v_prenex_143) 1) (not (= 0 v_prenex_142)) (= (select v_prenex_149 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_149 .cse7) 0) (= (select v_prenex_145 v_prenex_142) 1) (<= .cse11 v_prenex_146) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select (store v_prenex_144 .cse0 1) .cse14)) (= (select v_prenex_147 v_prenex_148) 0) (= (select v_prenex_147 v_prenex_146) 1) (= (let ((.cse15 (@diff v_prenex_145 v_prenex_150))) (store v_prenex_145 .cse15 (select v_prenex_150 .cse15))) v_prenex_150))))) (= .cse9 .cse7)))) (let ((.cse17 (+ .cse7 2))) (and .cse1 (<= .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_48| .cse9) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse18 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse18 (select |v_#valid_BEFORE_CALL_48| .cse18))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse9) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse7)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse19 (+ v_arrayElimIndex_49 2))) (and (<= .cse19 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse20 (select |v_#valid_BEFORE_CALL_44| .cse20))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse21 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse21 (select |v_#valid_BEFORE_CALL_45| .cse21))) |v_#valid_BEFORE_CALL_45|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse17 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse17 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse19 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))))))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-16 03:45:16,966 WARN L837 $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 ((.cse2 (+ .cse6 2))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse16 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse7 (select .cse16 0))) (let ((.cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse7)) (.cse9 (select .cse16 4))) (or (and .cse0 (or (let ((.cse4 (+ .cse9 2))) (and (exists ((v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_140 Int) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse1 (+ v_prenex_140 2))) (and (not (= 0 v_prenex_132)) (= (select v_prenex_136 v_prenex_139) 1) (<= .cse1 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (<= .cse2 v_prenex_132) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse3 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse3 (select v_prenex_138 .cse3))) v_prenex_138) (<= .cse4 v_prenex_137) (not (= 0 v_prenex_137)) (= (let ((.cse5 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse5 (select v_prenex_136 .cse5))) v_prenex_136) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse1 v_prenex_137) (<= .cse4 v_prenex_132) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_131 v_prenex_139) 0) (= (select v_prenex_133 v_prenex_132) 1) (<= .cse2 v_prenex_137) (= (select v_prenex_133 v_prenex_134) 0)))) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_135 (Array Int Int))) (and (= 0 (select v_prenex_141 .cse6)) (= (select v_prenex_141 .cse7) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse8 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse8 (select v_prenex_141 .cse8))) v_prenex_141) (= (select v_prenex_135 .cse7) 0) (= 0 (select (store v_prenex_141 .cse6 1) .cse9)))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_prenex_150 (Array Int Int)) (v_prenex_151 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_144 (Array Int Int)) (v_prenex_145 (Array Int Int)) (v_prenex_147 (Array Int Int)) (v_prenex_149 (Array Int Int)) (v_prenex_148 Int) (v_prenex_146 Int) (v_prenex_143 Int) (v_prenex_152 Int) (v_prenex_142 Int)) (let ((.cse14 (select .cse16 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse11 (+ v_prenex_152 2)) (.cse10 (+ .cse14 2))) (and (<= .cse10 v_prenex_146) (= 0 (select v_prenex_150 v_prenex_152)) (= (select v_prenex_144 .cse7) 1) (<= .cse2 v_prenex_146) (= (select v_prenex_151 v_prenex_148) 1) (<= .cse11 v_prenex_142) (not (= 0 v_prenex_146)) (<= .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse10 v_prenex_142) (= (let ((.cse12 (@diff v_prenex_147 v_prenex_151))) (store v_prenex_147 .cse12 (select v_prenex_151 .cse12))) v_prenex_151) (<= .cse2 v_prenex_142) (= 0 (select v_prenex_144 .cse6)) (= (let ((.cse13 (@diff v_prenex_149 v_prenex_144))) (store v_prenex_149 .cse13 (select v_prenex_144 .cse13))) v_prenex_144) (= (select v_prenex_145 v_prenex_143) 0) (= (select v_prenex_150 v_prenex_143) 1) (not (= 0 v_prenex_142)) (= (select v_prenex_149 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_149 .cse7) 0) (= (select v_prenex_145 v_prenex_142) 1) (<= .cse11 v_prenex_146) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select (store v_prenex_144 .cse6 1) .cse14)) (= (select v_prenex_147 v_prenex_148) 0) (= (select v_prenex_147 v_prenex_146) 1) (= (let ((.cse15 (@diff v_prenex_145 v_prenex_150))) (store v_prenex_145 .cse15 (select v_prenex_150 .cse15))) v_prenex_150))))) (= .cse9 .cse7)))) (let ((.cse17 (+ .cse7 2))) (and (<= .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0 (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_48| .cse9) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse18 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse18 (select |v_#valid_BEFORE_CALL_48| .cse18))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse9) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse6 1) .cse7)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse19 (+ v_arrayElimIndex_49 2))) (and (<= .cse19 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse20 (select |v_#valid_BEFORE_CALL_44| .cse20))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse21 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse21 (select |v_#valid_BEFORE_CALL_45| .cse21))) |v_#valid_BEFORE_CALL_45|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse17 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse17 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse19 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))))))) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse6 |c_ULTIMATE.start_main_~ptr~0#1.base|))))) is different from false [2023-02-16 03:45:16,977 WARN L859 $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 ((.cse2 (+ .cse6 2))) (and (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse16 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse7 (select .cse16 0))) (let ((.cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse7)) (.cse9 (select .cse16 4))) (or (and .cse0 (or (let ((.cse4 (+ .cse9 2))) (and (exists ((v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_140 Int) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse1 (+ v_prenex_140 2))) (and (not (= 0 v_prenex_132)) (= (select v_prenex_136 v_prenex_139) 1) (<= .cse1 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (<= .cse2 v_prenex_132) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse3 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse3 (select v_prenex_138 .cse3))) v_prenex_138) (<= .cse4 v_prenex_137) (not (= 0 v_prenex_137)) (= (let ((.cse5 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse5 (select v_prenex_136 .cse5))) v_prenex_136) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse1 v_prenex_137) (<= .cse4 v_prenex_132) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_131 v_prenex_139) 0) (= (select v_prenex_133 v_prenex_132) 1) (<= .cse2 v_prenex_137) (= (select v_prenex_133 v_prenex_134) 0)))) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_135 (Array Int Int))) (and (= 0 (select v_prenex_141 .cse6)) (= (select v_prenex_141 .cse7) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse8 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse8 (select v_prenex_141 .cse8))) v_prenex_141) (= (select v_prenex_135 .cse7) 0) (= 0 (select (store v_prenex_141 .cse6 1) .cse9)))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_prenex_150 (Array Int Int)) (v_prenex_151 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_144 (Array Int Int)) (v_prenex_145 (Array Int Int)) (v_prenex_147 (Array Int Int)) (v_prenex_149 (Array Int Int)) (v_prenex_148 Int) (v_prenex_146 Int) (v_prenex_143 Int) (v_prenex_152 Int) (v_prenex_142 Int)) (let ((.cse14 (select .cse16 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse11 (+ v_prenex_152 2)) (.cse10 (+ .cse14 2))) (and (<= .cse10 v_prenex_146) (= 0 (select v_prenex_150 v_prenex_152)) (= (select v_prenex_144 .cse7) 1) (<= .cse2 v_prenex_146) (= (select v_prenex_151 v_prenex_148) 1) (<= .cse11 v_prenex_142) (not (= 0 v_prenex_146)) (<= .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse10 v_prenex_142) (= (let ((.cse12 (@diff v_prenex_147 v_prenex_151))) (store v_prenex_147 .cse12 (select v_prenex_151 .cse12))) v_prenex_151) (<= .cse2 v_prenex_142) (= 0 (select v_prenex_144 .cse6)) (= (let ((.cse13 (@diff v_prenex_149 v_prenex_144))) (store v_prenex_149 .cse13 (select v_prenex_144 .cse13))) v_prenex_144) (= (select v_prenex_145 v_prenex_143) 0) (= (select v_prenex_150 v_prenex_143) 1) (not (= 0 v_prenex_142)) (= (select v_prenex_149 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_149 .cse7) 0) (= (select v_prenex_145 v_prenex_142) 1) (<= .cse11 v_prenex_146) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select (store v_prenex_144 .cse6 1) .cse14)) (= (select v_prenex_147 v_prenex_148) 0) (= (select v_prenex_147 v_prenex_146) 1) (= (let ((.cse15 (@diff v_prenex_145 v_prenex_150))) (store v_prenex_145 .cse15 (select v_prenex_150 .cse15))) v_prenex_150))))) (= .cse9 .cse7)))) (let ((.cse17 (+ .cse7 2))) (and (<= .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0 (exists ((|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_48| .cse9) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse18 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse18 (select |v_#valid_BEFORE_CALL_48| .cse18))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse9) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse6 1) .cse7)))) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse19 (+ v_arrayElimIndex_49 2))) (and (<= .cse19 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse20 (select |v_#valid_BEFORE_CALL_44| .cse20))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse21 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse21 (select |v_#valid_BEFORE_CALL_45| .cse21))) |v_#valid_BEFORE_CALL_45|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse17 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse17 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse19 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))))))))) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse6 |c_ULTIMATE.start_main_~ptr~0#1.base|))))) is different from true [2023-02-16 03:45:18,986 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_#t~mem17#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~mem17#1.base| 2))) (or (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_arrayElimCell_294 Int)) (let ((.cse1 (+ v_arrayElimCell_294 2))) (and (exists ((v_prenex_144 (Array Int Int)) (v_prenex_149 (Array Int Int))) (and (= (let ((.cse0 (@diff v_prenex_149 v_prenex_144))) (store v_prenex_149 .cse0 (select v_prenex_144 .cse0))) v_prenex_144) (= (select v_prenex_144 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_149 |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_149 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select (store v_prenex_144 |c_ULTIMATE.start_main_#t~mem17#1.base| 1) v_arrayElimCell_294)) (= 0 (select v_prenex_144 |c_ULTIMATE.start_main_#t~mem17#1.base|)))) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_prenex_148 Int) (v_prenex_150 (Array Int Int)) (v_prenex_146 Int) (v_prenex_151 (Array Int Int)) (v_prenex_143 Int) (v_prenex_152 Int) (v_prenex_142 Int) (v_prenex_145 (Array Int Int)) (v_prenex_147 (Array Int Int))) (let ((.cse3 (+ v_prenex_152 2))) (and (= 0 (select v_prenex_150 v_prenex_152)) (<= .cse1 v_prenex_146) (= (select v_prenex_145 v_prenex_143) 0) (= (select v_prenex_150 v_prenex_143) 1) (<= .cse2 v_prenex_142) (<= .cse2 v_prenex_146) (= (select v_prenex_151 v_prenex_148) 1) (not (= 0 v_prenex_142)) (<= .cse3 v_prenex_142) (not (= 0 v_prenex_146)) (= (select v_prenex_145 v_prenex_142) 1) (<= .cse3 v_prenex_146) (= (select v_prenex_147 v_prenex_148) 0) (= (select v_prenex_147 v_prenex_146) 1) (= (let ((.cse4 (@diff v_prenex_147 v_prenex_151))) (store v_prenex_147 .cse4 (select v_prenex_151 .cse4))) v_prenex_151) (<= .cse1 v_prenex_142) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse5 (@diff v_prenex_145 v_prenex_150))) (store v_prenex_145 .cse5 (select v_prenex_150 .cse5))) v_prenex_150))))))) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse9 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse6 (+ v_arrayElimIndex_49 2))) (and (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_45| .cse8))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse6 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (<= .cse9 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_292 Int) (|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse10 (select |v_#valid_BEFORE_CALL_48| .cse10))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_292) 1) (= (select |v_old(#valid)_AFTER_CALL_54| v_arrayElimCell_292) 0) (= (select |v_old(#valid)_AFTER_CALL_54| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select (store |v_#valid_BEFORE_CALL_48| |c_ULTIMATE.start_main_#t~mem17#1.base| 1) |c_ULTIMATE.start_main_~ptr~0#1.base|))))))) (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_arrayElimCell_292 Int)) (let ((.cse11 (+ v_arrayElimCell_292 2))) (and (<= .cse11 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_135 (Array Int Int))) (and (= 0 (select (store v_prenex_141 |c_ULTIMATE.start_main_#t~mem17#1.base| 1) v_arrayElimCell_292)) (= (select v_prenex_141 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select v_prenex_141 |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (let ((.cse12 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse12 (select v_prenex_141 .cse12))) v_prenex_141) (= (select v_prenex_135 |ULTIMATE.start_main_~#s~0#1.base|) 1))) (exists ((v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_140 Int) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse13 (+ v_prenex_140 2))) (and (not (= 0 v_prenex_132)) (<= .cse2 v_prenex_137) (<= .cse11 v_prenex_137) (= (select v_prenex_136 v_prenex_139) 1) (<= .cse13 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (<= .cse2 v_prenex_132) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse14 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse14 (select v_prenex_138 .cse14))) v_prenex_138) (not (= 0 v_prenex_137)) (= (let ((.cse15 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse15 (select v_prenex_136 .cse15))) v_prenex_136) (<= .cse13 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse13 v_prenex_137) (<= .cse11 v_prenex_132) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_131 v_prenex_139) 0) (= (select v_prenex_133 v_prenex_132) 1) (= (select v_prenex_133 v_prenex_134) 0))))))) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_135 (Array Int Int)) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int)) (v_arrayElimCell_292 Int) (v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_140 Int)) (let ((.cse16 (+ v_arrayElimCell_292 2)) (.cse19 (+ v_prenex_140 2))) (and (<= .cse16 |ULTIMATE.start_main_~#s~0#1.base|) (= (select v_prenex_136 v_prenex_139) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse17 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse17 (select v_prenex_141 .cse17))) v_prenex_141) (= (let ((.cse18 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse18 (select v_prenex_136 .cse18))) v_prenex_136) (= 0 (select (store v_prenex_141 |c_ULTIMATE.start_main_#t~mem17#1.base| 1) v_arrayElimCell_292)) (= (select v_prenex_141 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= .cse19 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse16 v_prenex_132) (= (select v_prenex_131 v_prenex_139) 0) (= 0 (select v_prenex_141 |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (select v_prenex_135 |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_133 v_prenex_134) 0) (not (= 0 v_prenex_132)) (<= .cse2 v_prenex_137) (<= .cse16 v_prenex_137) (<= .cse19 v_prenex_132) (<= .cse2 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (= (let ((.cse20 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse20 (select v_prenex_138 .cse20))) v_prenex_138) (not (= 0 v_prenex_137)) (<= .cse19 v_prenex_137) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_133 v_prenex_132) 1)))) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2023-02-16 03:45:18,999 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_#t~mem17#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~mem17#1.base| 2))) (or (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_arrayElimCell_294 Int)) (let ((.cse1 (+ v_arrayElimCell_294 2))) (and (exists ((v_prenex_144 (Array Int Int)) (v_prenex_149 (Array Int Int))) (and (= (let ((.cse0 (@diff v_prenex_149 v_prenex_144))) (store v_prenex_149 .cse0 (select v_prenex_144 .cse0))) v_prenex_144) (= (select v_prenex_144 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_149 |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_149 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select (store v_prenex_144 |c_ULTIMATE.start_main_#t~mem17#1.base| 1) v_arrayElimCell_294)) (= 0 (select v_prenex_144 |c_ULTIMATE.start_main_#t~mem17#1.base|)))) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_prenex_148 Int) (v_prenex_150 (Array Int Int)) (v_prenex_146 Int) (v_prenex_151 (Array Int Int)) (v_prenex_143 Int) (v_prenex_152 Int) (v_prenex_142 Int) (v_prenex_145 (Array Int Int)) (v_prenex_147 (Array Int Int))) (let ((.cse3 (+ v_prenex_152 2))) (and (= 0 (select v_prenex_150 v_prenex_152)) (<= .cse1 v_prenex_146) (= (select v_prenex_145 v_prenex_143) 0) (= (select v_prenex_150 v_prenex_143) 1) (<= .cse2 v_prenex_142) (<= .cse2 v_prenex_146) (= (select v_prenex_151 v_prenex_148) 1) (not (= 0 v_prenex_142)) (<= .cse3 v_prenex_142) (not (= 0 v_prenex_146)) (= (select v_prenex_145 v_prenex_142) 1) (<= .cse3 v_prenex_146) (= (select v_prenex_147 v_prenex_148) 0) (= (select v_prenex_147 v_prenex_146) 1) (= (let ((.cse4 (@diff v_prenex_147 v_prenex_151))) (store v_prenex_147 .cse4 (select v_prenex_151 .cse4))) v_prenex_151) (<= .cse1 v_prenex_142) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse5 (@diff v_prenex_145 v_prenex_150))) (store v_prenex_145 .cse5 (select v_prenex_150 .cse5))) v_prenex_150))))))) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse9 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30| Int) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_45| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (|v_#valid_BEFORE_CALL_44| (Array Int Int)) (v_arrayElimCell_267 Int) (v_arrayElimIndex_49 Int)) (let ((.cse6 (+ v_arrayElimIndex_49 2))) (and (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimIndex_49)) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse7 (select |v_#valid_BEFORE_CALL_44| .cse7))) |v_#valid_BEFORE_CALL_44|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse8 (select |v_#valid_BEFORE_CALL_45| .cse8))) |v_#valid_BEFORE_CALL_45|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (not (= 0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_267) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse9 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_44| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267) 1) (<= .cse6 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)))) (<= .cse9 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_292 Int) (|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_48| |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse10 (select |v_#valid_BEFORE_CALL_48| .cse10))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_292) 1) (= (select |v_old(#valid)_AFTER_CALL_54| v_arrayElimCell_292) 0) (= (select |v_old(#valid)_AFTER_CALL_54| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select (store |v_#valid_BEFORE_CALL_48| |c_ULTIMATE.start_main_#t~mem17#1.base| 1) |c_ULTIMATE.start_main_~ptr~0#1.base|))))))) (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_arrayElimCell_292 Int)) (let ((.cse11 (+ v_arrayElimCell_292 2))) (and (<= .cse11 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_135 (Array Int Int))) (and (= 0 (select (store v_prenex_141 |c_ULTIMATE.start_main_#t~mem17#1.base| 1) v_arrayElimCell_292)) (= (select v_prenex_141 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select v_prenex_141 |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (let ((.cse12 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse12 (select v_prenex_141 .cse12))) v_prenex_141) (= (select v_prenex_135 |ULTIMATE.start_main_~#s~0#1.base|) 1))) (exists ((v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_140 Int) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int))) (let ((.cse13 (+ v_prenex_140 2))) (and (not (= 0 v_prenex_132)) (<= .cse2 v_prenex_137) (<= .cse11 v_prenex_137) (= (select v_prenex_136 v_prenex_139) 1) (<= .cse13 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (<= .cse2 v_prenex_132) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse14 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse14 (select v_prenex_138 .cse14))) v_prenex_138) (not (= 0 v_prenex_137)) (= (let ((.cse15 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse15 (select v_prenex_136 .cse15))) v_prenex_136) (<= .cse13 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse13 v_prenex_137) (<= .cse11 v_prenex_132) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_131 v_prenex_139) 0) (= (select v_prenex_133 v_prenex_132) 1) (= (select v_prenex_133 v_prenex_134) 0))))))) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|))) (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_prenex_141 (Array Int Int)) (v_prenex_131 (Array Int Int)) (v_prenex_133 (Array Int Int)) (v_prenex_135 (Array Int Int)) (v_prenex_136 (Array Int Int)) (v_prenex_138 (Array Int Int)) (v_arrayElimCell_292 Int) (v_prenex_139 Int) (v_prenex_137 Int) (v_prenex_134 Int) (v_prenex_132 Int) (v_prenex_140 Int)) (let ((.cse16 (+ v_arrayElimCell_292 2)) (.cse19 (+ v_prenex_140 2))) (and (<= .cse16 |ULTIMATE.start_main_~#s~0#1.base|) (= (select v_prenex_136 v_prenex_139) 1) (= (select v_prenex_135 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_138 v_prenex_134) 1) (= (let ((.cse17 (@diff v_prenex_135 v_prenex_141))) (store v_prenex_135 .cse17 (select v_prenex_141 .cse17))) v_prenex_141) (= (let ((.cse18 (@diff v_prenex_131 v_prenex_136))) (store v_prenex_131 .cse18 (select v_prenex_136 .cse18))) v_prenex_136) (= 0 (select (store v_prenex_141 |c_ULTIMATE.start_main_#t~mem17#1.base| 1) v_arrayElimCell_292)) (= (select v_prenex_141 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= .cse19 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse16 v_prenex_132) (= (select v_prenex_131 v_prenex_139) 0) (= 0 (select v_prenex_141 |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (select v_prenex_135 |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_133 v_prenex_134) 0) (not (= 0 v_prenex_132)) (<= .cse2 v_prenex_137) (<= .cse16 v_prenex_137) (<= .cse19 v_prenex_132) (<= .cse2 v_prenex_132) (= 0 (select v_prenex_136 v_prenex_140)) (= (let ((.cse20 (@diff v_prenex_133 v_prenex_138))) (store v_prenex_133 .cse20 (select v_prenex_138 .cse20))) v_prenex_138) (not (= 0 v_prenex_137)) (<= .cse19 v_prenex_137) (= (select v_prenex_131 v_prenex_137) 1) (= (select v_prenex_133 v_prenex_132) 1)))) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|)))))) is different from true [2023-02-16 03:45:19,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:45:19,186 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2023-02-16 03:45:19,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-02-16 03:45:19,187 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 74 states have (on average 1.527027027027027) internal successors, (113), 68 states have internal predecessors, (113), 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 66 [2023-02-16 03:45:19,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:45:19,188 INFO L225 Difference]: With dead ends: 106 [2023-02-16 03:45:19,188 INFO L226 Difference]: Without dead ends: 106 [2023-02-16 03:45:19,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 126 ConstructedPredicates, 81 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=311, Invalid=1968, Unknown=207, NotChecked=13770, Total=16256 [2023-02-16 03:45:19,190 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 9 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 2442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1888 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:45:19,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 997 Invalid, 2442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 552 Invalid, 0 Unknown, 1888 Unchecked, 0.4s Time] [2023-02-16 03:45:19,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-16 03:45:19,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-02-16 03:45:19,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.223529411764706) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:45:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2023-02-16 03:45:19,193 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 66 [2023-02-16 03:45:19,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:45:19,194 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2023-02-16 03:45:19,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 74 states have (on average 1.527027027027027) internal successors, (113), 68 states have internal predecessors, (113), 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) [2023-02-16 03:45:19,194 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2023-02-16 03:45:19,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-16 03:45:19,194 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:45:19,195 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:45:19,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-16 03:45:19,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:45:19,402 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-02-16 03:45:19,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:45:19,402 INFO L85 PathProgramCache]: Analyzing trace with hash 792357101, now seen corresponding path program 1 times [2023-02-16 03:45:19,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:45:19,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173050692] [2023-02-16 03:45:19,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:45:19,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:45:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:45:24,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:45:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:45:25,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:45:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:45:25,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:45:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:45:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:45:26,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:45:26,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173050692] [2023-02-16 03:45:26,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173050692] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:45:26,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345380774] [2023-02-16 03:45:26,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:45:26,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:45:26,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:45:26,800 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:45:26,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-16 03:45:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:45:27,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 235 conjunts are in the unsatisfiable core [2023-02-16 03:45:27,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:45:27,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:45:27,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:45:27,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:45:27,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:45:27,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:27,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-02-16 03:45:27,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 03:45:27,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:45:27,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:45:28,554 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:45:28,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:45:28,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:45:28,607 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:45:28,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 03:45:28,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:28,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:45:28,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:45:28,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:45:28,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:45:29,128 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:45:29,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 75 [2023-02-16 03:45:29,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:29,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2023-02-16 03:45:29,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 03:45:29,496 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:45:29,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 45 [2023-02-16 03:45:29,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-16 03:45:29,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:29,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:45:29,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:29,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2023-02-16 03:45:29,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:29,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 38 [2023-02-16 03:45:29,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 03:45:30,136 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:45:30,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 54 [2023-02-16 03:45:30,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:30,144 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2023-02-16 03:45:30,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:45:30,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 03:45:30,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:45:30,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:30,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:45:30,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:30,920 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:45:30,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 97 [2023-02-16 03:45:30,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:30,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:30,938 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 03:45:30,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2023-02-16 03:45:30,964 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-16 03:45:30,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 36 [2023-02-16 03:45:30,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:45:30,993 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 03:45:30,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-16 03:45:32,194 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2023-02-16 03:45:32,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 216 treesize of output 167 [2023-02-16 03:45:32,201 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:45:32,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:32,217 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-16 03:45:32,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 111 treesize of output 93 [2023-02-16 03:45:32,223 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:45:32,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:32,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2023-02-16 03:45:32,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:32,399 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:45:32,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 95 [2023-02-16 03:45:32,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-16 03:45:32,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:32,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:32,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-02-16 03:45:32,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:32,870 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-16 03:45:32,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 82 [2023-02-16 03:45:32,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:32,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:32,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:32,895 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2023-02-16 03:45:32,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-16 03:45:33,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:33,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:33,414 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:45:33,418 INFO L321 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2023-02-16 03:45:33,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 201 treesize of output 124 [2023-02-16 03:45:33,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:33,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2023-02-16 03:45:33,459 INFO L321 Elim1Store]: treesize reduction 159, result has 12.2 percent of original size [2023-02-16 03:45:33,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 361 treesize of output 267 [2023-02-16 03:45:34,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:34,700 INFO L321 Elim1Store]: treesize reduction 41, result has 16.3 percent of original size [2023-02-16 03:45:34,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 327 treesize of output 109 [2023-02-16 03:45:34,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:34,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:34,717 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-02-16 03:45:34,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 37 [2023-02-16 03:45:35,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:45:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:45:35,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:45:39,785 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6265 (Array Int Int)) (v_ArrVal_6267 (Array Int Int)) (v_ArrVal_6270 Int) (v_ArrVal_6271 (Array Int Int)) (v_ArrVal_6263 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store v_ArrVal_6265 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_6270)))) (let ((.cse4 (select (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store v_ArrVal_6263 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6263) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (+ .cse4 4))) (let ((.cse8 (store .cse10 .cse1 (store (select .cse10 .cse1) .cse0 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) (.cse7 (store .cse9 .cse1 (store (select .cse9 .cse1) .cse0 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select .cse8 .cse5) .cse6)) (.cse2 (select (select .cse7 .cse5) .cse6))) (or (not (<= 0 .cse0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6267) .cse1 v_ArrVal_6271) .cse2) (+ .cse3 8)) |c_ULTIMATE.start_main_~data~0#1|) (not (<= (+ .cse4 8) (select |c_#length| .cse1))) (= .cse2 .cse5) (< v_ArrVal_6270 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6265) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (not (<= 0 .cse6)) (not (<= (+ .cse3 12) (select |c_#length| .cse2))))))))))) (forall ((v_ArrVal_6265 (Array Int Int)) (v_ArrVal_6267 (Array Int Int)) (v_ArrVal_6270 Int) (v_ArrVal_6271 (Array Int Int)) (v_ArrVal_6263 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store v_ArrVal_6265 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_6270)))) (let ((.cse16 (select (select .cse21 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store v_ArrVal_6263 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6263) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))))) (let ((.cse14 (select (select .cse20 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse11 (+ .cse16 4))) (let ((.cse19 (store .cse21 .cse14 (store (select .cse21 .cse14) .cse11 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) (.cse17 (store .cse20 .cse14 (store (select .cse20 .cse14) .cse11 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (select (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (select (select .cse19 .cse18) .cse13)) (.cse15 (select (select .cse17 .cse18) .cse13))) (or (not (<= 0 .cse11)) (= .cse12 .cse13) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6267) .cse14 v_ArrVal_6271) .cse15) (+ .cse12 8)) |c_ULTIMATE.start_main_~data~0#1|) (not (<= (+ .cse16 8) (select |c_#length| .cse14))) (< v_ArrVal_6270 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6265) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (not (<= 0 .cse13)) (not (<= (+ .cse12 12) (select |c_#length| .cse15)))))))))))) is different from false [2023-02-16 03:45:40,216 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|))) (and (forall ((v_ArrVal_6265 (Array Int Int)) (v_ArrVal_6267 (Array Int Int)) (v_ArrVal_6270 Int) (v_ArrVal_6259 Int) (v_ArrVal_6261 (Array Int Int)) (v_ArrVal_6271 (Array Int Int)) (v_ArrVal_6263 (Array Int Int)) (v_ArrVal_6262 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6262))) (let ((.cse12 (store .cse7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store v_ArrVal_6265 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_6270)))) (let ((.cse8 (select (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6261))) (store .cse13 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store v_ArrVal_6263 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select (select (store .cse13 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6263) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ .cse8 4))) (let ((.cse9 (store .cse12 .cse6 (store (select .cse12 .cse6) .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) (.cse10 (store .cse11 .cse6 (store (select .cse11 .cse6) .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (let ((.cse3 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse10 .cse3) .cse4)) (.cse0 (select (select .cse9 .cse3) .cse4))) (or (not (<= (+ .cse0 12) (select |c_#length| .cse1))) (not (<= 0 .cse2)) (= .cse1 .cse3) (not (<= 0 .cse4)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_append_~last~1#1.offset| v_ArrVal_6259)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6267) .cse6 v_ArrVal_6271) .cse1) (+ .cse0 8)) |c_ULTIMATE.start_main_~data~0#1|) (< v_ArrVal_6270 (select (select (store .cse7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6265) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (not (<= (+ .cse8 8) (select |c_#length| .cse6)))))))))))) (forall ((v_ArrVal_6265 (Array Int Int)) (v_ArrVal_6267 (Array Int Int)) (v_ArrVal_6270 Int) (v_ArrVal_6259 Int) (v_ArrVal_6261 (Array Int Int)) (v_ArrVal_6271 (Array Int Int)) (v_ArrVal_6263 (Array Int Int)) (v_ArrVal_6262 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6262))) (let ((.cse25 (store .cse19 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store v_ArrVal_6265 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_6270)))) (let ((.cse20 (select (select .cse25 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse24 (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6261))) (store .cse26 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store v_ArrVal_6263 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select (select (store .cse26 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6263) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) (let ((.cse18 (select (select .cse24 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse16 (+ .cse20 4))) (let ((.cse21 (store .cse25 .cse18 (store (select .cse25 .cse18) .cse16 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) (.cse23 (store .cse24 .cse18 (store (select .cse24 .cse18) .cse16 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse17 (select (select .cse21 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse15 (select (select .cse23 .cse22) .cse17)) (.cse14 (select (select .cse21 .cse22) .cse17))) (or (not (<= (+ .cse14 12) (select |c_#length| .cse15))) (not (<= 0 .cse16)) (not (<= 0 .cse17)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_append_~last~1#1.offset| v_ArrVal_6259)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6267) .cse18 v_ArrVal_6271) .cse15) (+ .cse14 8)) |c_ULTIMATE.start_main_~data~0#1|) (< v_ArrVal_6270 (select (select (store .cse19 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6265) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= .cse14 .cse17) (not (<= (+ .cse20 8) (select |c_#length| .cse18)))))))))))))) is different from false [2023-02-16 03:45:40,636 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base|))) (and (forall ((v_ArrVal_6265 (Array Int Int)) (v_ArrVal_6267 (Array Int Int)) (v_ArrVal_6270 Int) (v_ArrVal_6259 Int) (v_ArrVal_6261 (Array Int Int)) (v_ArrVal_6271 (Array Int Int)) (v_ArrVal_6263 (Array Int Int)) (v_ArrVal_6262 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6262))) (let ((.cse12 (store .cse0 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store v_ArrVal_6265 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_6270)))) (let ((.cse8 (select (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6261))) (store .cse13 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store v_ArrVal_6263 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select (select (store .cse13 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6263) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) (let ((.cse2 (select (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (+ .cse8 4))) (let ((.cse10 (store .cse12 .cse2 (store (select .cse12 .cse2) .cse7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) (.cse9 (store .cse11 .cse2 (store (select .cse11 .cse2) .cse7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select .cse10 .cse5) .cse6)) (.cse3 (select (select .cse9 .cse5) .cse6))) (or (< v_ArrVal_6270 (select (select (store .cse0 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6265) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.offset| v_ArrVal_6259)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6267) .cse2 v_ArrVal_6271) .cse3) (+ .cse4 8)) |c_ULTIMATE.start_main_~data~0#1|) (= .cse3 .cse5) (not (<= 0 .cse6)) (not (<= (+ .cse4 12) (select |c_#length| .cse3))) (not (<= 0 .cse7)) (not (<= (+ .cse8 8) (select |c_#length| .cse2)))))))))))) (forall ((v_ArrVal_6265 (Array Int Int)) (v_ArrVal_6267 (Array Int Int)) (v_ArrVal_6270 Int) (v_ArrVal_6259 Int) (v_ArrVal_6261 (Array Int Int)) (v_ArrVal_6271 (Array Int Int)) (v_ArrVal_6263 (Array Int Int)) (v_ArrVal_6262 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6262))) (let ((.cse25 (store .cse14 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store v_ArrVal_6265 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_6270)))) (let ((.cse20 (select (select .cse25 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse24 (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6261))) (store .cse26 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store v_ArrVal_6263 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select (select (store .cse26 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6263) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) (let ((.cse15 (select (select .cse24 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse19 (+ .cse20 4))) (let ((.cse21 (store .cse25 .cse15 (store (select .cse25 .cse15) .cse19 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) (.cse23 (store .cse24 .cse15 (store (select .cse24 .cse15) .cse19 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (select (select .cse21 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (select (select .cse23 .cse22) .cse18)) (.cse17 (select (select .cse21 .cse22) .cse18))) (or (< v_ArrVal_6270 (select (select (store .cse14 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6265) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.offset| v_ArrVal_6259)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6267) .cse15 v_ArrVal_6271) .cse16) (+ .cse17 8)) |c_ULTIMATE.start_main_~data~0#1|) (not (<= 0 .cse18)) (not (<= (+ .cse17 12) (select |c_#length| .cse16))) (not (<= 0 .cse19)) (= .cse17 .cse18) (not (<= (+ .cse20 8) (select |c_#length| .cse15)))))))))))))) is different from false [2023-02-16 03:45:41,062 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse29 (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) .cse29))) (let ((.cse6 (select |c_#memory_int| .cse5)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) .cse29))) (and (forall ((v_ArrVal_6265 (Array Int Int)) (v_ArrVal_6267 (Array Int Int)) (v_ArrVal_6270 Int) (v_ArrVal_6259 Int) (v_ArrVal_6261 (Array Int Int)) (v_ArrVal_6271 (Array Int Int)) (v_ArrVal_6263 (Array Int Int)) (v_ArrVal_6262 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_6262))) (let ((.cse14 (store .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store v_ArrVal_6265 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_6270)))) (let ((.cse1 (select (select .cse14 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse13 (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_6261))) (store .cse15 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store v_ArrVal_6263 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select (select (store .cse15 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6263) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) (let ((.cse2 (select (select .cse13 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ .cse1 4))) (let ((.cse12 (store .cse14 .cse2 (store (select .cse14 .cse2) .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) (.cse11 (store .cse13 .cse2 (store (select .cse13 .cse2) .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (select (select .cse12 .cse10) .cse0)) (.cse8 (select (select .cse11 .cse10) .cse0))) (or (not (<= 0 .cse0)) (not (<= (+ .cse1 8) (select |c_#length| .cse2))) (not (<= 0 .cse3)) (< v_ArrVal_6270 (select (select (store .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6265) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= (select (select (store (store (store |c_#memory_int| .cse5 (store .cse6 .cse7 v_ArrVal_6259)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6267) .cse2 v_ArrVal_6271) .cse8) (+ .cse9 8)) |c_ULTIMATE.start_main_~data~0#1|) (= .cse8 .cse10) (not (<= (+ .cse9 12) (select |c_#length| .cse8)))))))))))) (forall ((v_ArrVal_6265 (Array Int Int)) (v_ArrVal_6267 (Array Int Int)) (v_ArrVal_6270 Int) (v_ArrVal_6259 Int) (v_ArrVal_6261 (Array Int Int)) (v_ArrVal_6271 (Array Int Int)) (v_ArrVal_6263 (Array Int Int)) (v_ArrVal_6262 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_6262))) (let ((.cse27 (store .cse20 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store v_ArrVal_6265 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_6270)))) (let ((.cse17 (select (select .cse27 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse26 (let ((.cse28 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_6261))) (store .cse28 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store v_ArrVal_6263 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select (select (store .cse28 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6263) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) (let ((.cse18 (select (select .cse26 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse19 (+ .cse17 4))) (let ((.cse23 (store .cse27 .cse18 (store (select .cse27 .cse18) .cse19 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) (.cse25 (store .cse26 .cse18 (store (select .cse26 .cse18) .cse19 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (let ((.cse24 (select (select .cse25 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (select (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse21 (select (select .cse25 .cse24) .cse16)) (.cse22 (select (select .cse23 .cse24) .cse16))) (or (not (<= 0 .cse16)) (not (<= (+ .cse17 8) (select |c_#length| .cse18))) (not (<= 0 .cse19)) (< v_ArrVal_6270 (select (select (store .cse20 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6265) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= (select (select (store (store (store |c_#memory_int| .cse5 (store .cse6 .cse7 v_ArrVal_6259)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6267) .cse18 v_ArrVal_6271) .cse21) (+ .cse22 8)) |c_ULTIMATE.start_main_~data~0#1|) (not (<= (+ .cse22 12) (select |c_#length| .cse21))) (= .cse22 .cse16)))))))))))))) is different from false [2023-02-16 03:45:41,459 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse29 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse30 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse29) .cse30))) (let ((.cse9 (select |c_#memory_int| .cse8)) (.cse10 (select (select |c_#memory_$Pointer$.offset| .cse29) .cse30))) (and (forall ((v_ArrVal_6265 (Array Int Int)) (v_ArrVal_6267 (Array Int Int)) (v_ArrVal_6270 Int) (v_ArrVal_6259 Int) (v_ArrVal_6261 (Array Int Int)) (v_ArrVal_6271 (Array Int Int)) (v_ArrVal_6263 (Array Int Int)) (v_ArrVal_6262 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_6262))) (let ((.cse14 (store .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store v_ArrVal_6265 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_6270)))) (let ((.cse3 (select (select .cse14 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse13 (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_6261))) (store .cse15 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store v_ArrVal_6263 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select (select (store .cse15 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6263) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) (let ((.cse4 (select (select .cse13 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (+ .cse3 4))) (let ((.cse11 (store .cse14 .cse4 (store (select .cse14 .cse4) .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) (.cse12 (store .cse13 .cse4 (store (select .cse13 .cse4) .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse12 .cse7) .cse6)) (.cse0 (select (select .cse11 .cse7) .cse6))) (or (not (<= (+ .cse0 12) (select |c_#length| .cse1))) (< v_ArrVal_6270 (select (select (store .cse2 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6265) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (not (<= (+ .cse3 8) (select |c_#length| .cse4))) (not (<= 0 .cse5)) (not (<= 0 .cse6)) (= .cse1 .cse7) (= (select (select (store (store (store |c_#memory_int| .cse8 (store .cse9 .cse10 v_ArrVal_6259)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6267) .cse4 v_ArrVal_6271) .cse1) (+ .cse0 8)) |c_ULTIMATE.start_main_~data~0#1|)))))))))) (forall ((v_ArrVal_6265 (Array Int Int)) (v_ArrVal_6267 (Array Int Int)) (v_ArrVal_6270 Int) (v_ArrVal_6259 Int) (v_ArrVal_6261 (Array Int Int)) (v_ArrVal_6271 (Array Int Int)) (v_ArrVal_6263 (Array Int Int)) (v_ArrVal_6262 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_6262))) (let ((.cse27 (store .cse18 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store v_ArrVal_6265 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_6270)))) (let ((.cse19 (select (select .cse27 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse26 (let ((.cse28 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_6261))) (store .cse28 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store v_ArrVal_6263 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select (select (store .cse28 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6263) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) (let ((.cse20 (select (select .cse26 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse22 (+ .cse19 4))) (let ((.cse23 (store .cse27 .cse20 (store (select .cse27 .cse20) .cse22 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) (.cse25 (store .cse26 .cse20 (store (select .cse26 .cse20) .cse22 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (let ((.cse24 (select (select .cse25 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse21 (select (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse17 (select (select .cse25 .cse24) .cse21)) (.cse16 (select (select .cse23 .cse24) .cse21))) (or (not (<= (+ .cse16 12) (select |c_#length| .cse17))) (< v_ArrVal_6270 (select (select (store .cse18 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6265) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (not (<= (+ .cse19 8) (select |c_#length| .cse20))) (= .cse16 .cse21) (not (<= 0 .cse22)) (not (<= 0 .cse21)) (= (select (select (store (store (store |c_#memory_int| .cse8 (store .cse9 .cse10 v_ArrVal_6259)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6267) .cse20 v_ArrVal_6271) .cse17) (+ .cse16 8)) |c_ULTIMATE.start_main_~data~0#1|)))))))))))))) is different from false [2023-02-16 03:45:41,975 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse29 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse30 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse29) .cse30))) (let ((.cse5 (select |c_#memory_int| .cse4)) (.cse6 (select (select |c_#memory_$Pointer$.offset| .cse29) .cse30))) (and (forall ((v_ArrVal_6265 (Array Int Int)) (v_ArrVal_6267 (Array Int Int)) (v_ArrVal_6270 Int) (v_ArrVal_6259 Int) (v_ArrVal_6261 (Array Int Int)) (v_ArrVal_6271 (Array Int Int)) (v_ArrVal_6263 (Array Int Int)) (v_ArrVal_6262 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_6262))) (let ((.cse14 (store .cse9 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store v_ArrVal_6265 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| v_ArrVal_6270)))) (let ((.cse2 (select (select .cse14 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse13 (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_6261))) (store .cse15 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store v_ArrVal_6263 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| (select (select (store .cse15 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6263) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) (let ((.cse3 (select (select .cse13 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (+ .cse2 4))) (let ((.cse12 (store .cse14 .cse3 (store (select .cse14 .cse3) .cse7 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))) (.cse11 (store .cse13 .cse3 (store (select .cse13 .cse3) .cse7 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select .cse12 .cse10) .cse8)) (.cse1 (select (select .cse11 .cse10) .cse8))) (or (not (<= (+ .cse0 12) (select |c_#length| .cse1))) (not (<= (+ .cse2 8) (select |c_#length| .cse3))) (= (select (select (store (store (store |c_#memory_int| .cse4 (store .cse5 .cse6 v_ArrVal_6259)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6267) .cse3 v_ArrVal_6271) .cse1) (+ .cse0 8)) |c_ULTIMATE.start_main_~data~0#1|) (not (<= 0 .cse7)) (not (<= 0 .cse8)) (< v_ArrVal_6270 (select (select (store .cse9 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6265) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= .cse1 .cse10)))))))))) (forall ((v_ArrVal_6265 (Array Int Int)) (v_ArrVal_6267 (Array Int Int)) (v_ArrVal_6270 Int) (v_ArrVal_6259 Int) (v_ArrVal_6261 (Array Int Int)) (v_ArrVal_6271 (Array Int Int)) (v_ArrVal_6263 (Array Int Int)) (v_ArrVal_6262 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_6262))) (let ((.cse27 (store .cse22 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store v_ArrVal_6265 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| v_ArrVal_6270)))) (let ((.cse18 (select (select .cse27 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse26 (let ((.cse28 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_6261))) (store .cse28 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store v_ArrVal_6263 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| (select (select (store .cse28 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6263) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) (let ((.cse19 (select (select .cse26 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse20 (+ .cse18 4))) (let ((.cse23 (store .cse27 .cse19 (store (select .cse27 .cse19) .cse20 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))) (.cse25 (store .cse26 .cse19 (store (select .cse26 .cse19) .cse20 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)))) (let ((.cse24 (select (select .cse25 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse21 (select (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse17 (select (select .cse25 .cse24) .cse21)) (.cse16 (select (select .cse23 .cse24) .cse21))) (or (not (<= (+ .cse16 12) (select |c_#length| .cse17))) (not (<= (+ .cse18 8) (select |c_#length| .cse19))) (= (select (select (store (store (store |c_#memory_int| .cse4 (store .cse5 .cse6 v_ArrVal_6259)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6267) .cse19 v_ArrVal_6271) .cse17) (+ .cse16 8)) |c_ULTIMATE.start_main_~data~0#1|) (not (<= 0 .cse20)) (not (<= 0 .cse21)) (< v_ArrVal_6270 (select (select (store .cse22 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6265) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= .cse16 .cse21)))))))))))))) is different from false