./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 e8d55036 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-?-e8d5503-m [2023-02-15 22:23:33,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:23:33,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:23:33,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:23:33,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:23:33,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:23:33,068 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:23:33,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:23:33,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:23:33,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:23:33,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:23:33,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:23:33,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:23:33,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:23:33,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:23:33,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:23:33,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:23:33,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:23:33,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:23:33,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:23:33,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:23:33,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:23:33,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:23:33,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:23:33,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:23:33,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:23:33,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:23:33,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:23:33,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:23:33,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:23:33,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:23:33,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:23:33,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:23:33,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:23:33,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:23:33,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:23:33,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:23:33,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:23:33,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:23:33,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:23:33,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:23:33,113 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 22:23:33,141 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:23:33,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:23:33,142 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:23:33,142 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:23:33,143 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:23:33,143 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:23:33,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:23:33,143 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:23:33,144 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:23:33,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:23:33,144 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:23:33,145 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:23:33,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:23:33,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:23:33,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:23:33,145 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:23:33,145 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:23:33,145 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:23:33,146 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:23:33,146 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:23:33,146 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:23:33,146 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:23:33,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:23:33,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:23:33,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:23:33,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:23:33,147 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:23:33,147 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:23:33,147 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:23:33,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:23:33,147 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:23:33,148 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:23:33,148 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:23:33,148 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:23:33,148 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-15 22:23:33,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:23:33,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:23:33,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:23:33,385 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:23:33,386 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:23:33,386 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-15 22:23:34,419 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:23:34,605 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:23:34,607 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_equal.i [2023-02-15 22:23:34,616 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f5e65ee9/3c8b008d1c2b46ba97513cb18ce0dda1/FLAG449685079 [2023-02-15 22:23:35,006 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f5e65ee9/3c8b008d1c2b46ba97513cb18ce0dda1 [2023-02-15 22:23:35,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:23:35,009 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:23:35,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:23:35,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:23:35,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:23:35,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:23:35" (1/1) ... [2023-02-15 22:23:35,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dc97c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:35, skipping insertion in model container [2023-02-15 22:23:35,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:23:35" (1/1) ... [2023-02-15 22:23:35,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:23:35,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:23:35,300 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-15 22:23:35,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:23:35,310 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:23:35,346 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-15 22:23:35,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:23:35,374 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:23:35,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:35 WrapperNode [2023-02-15 22:23:35,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:23:35,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:23:35,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:23:35,375 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:23:35,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:35" (1/1) ... [2023-02-15 22:23:35,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:35" (1/1) ... [2023-02-15 22:23:35,408 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 140 [2023-02-15 22:23:35,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:23:35,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:23:35,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:23:35,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:23:35,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:35" (1/1) ... [2023-02-15 22:23:35,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:35" (1/1) ... [2023-02-15 22:23:35,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:35" (1/1) ... [2023-02-15 22:23:35,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:35" (1/1) ... [2023-02-15 22:23:35,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:35" (1/1) ... [2023-02-15 22:23:35,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:35" (1/1) ... [2023-02-15 22:23:35,449 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:35" (1/1) ... [2023-02-15 22:23:35,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:35" (1/1) ... [2023-02-15 22:23:35,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:23:35,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:23:35,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:23:35,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:23:35,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:35" (1/1) ... [2023-02-15 22:23:35,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:23:35,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:23:35,495 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-15 22:23:35,497 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-15 22:23:35,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 22:23:35,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 22:23:35,521 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 22:23:35,521 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 22:23:35,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:23:35,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:23:35,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 22:23:35,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:23:35,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:23:35,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:23:35,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 22:23:35,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:23:35,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:23:35,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:23:35,665 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:23:35,666 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:23:35,916 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:23:35,929 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:23:35,929 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 22:23:35,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:23:35 BoogieIcfgContainer [2023-02-15 22:23:35,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:23:35,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:23:35,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:23:35,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:23:35,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:23:35" (1/3) ... [2023-02-15 22:23:35,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffc03a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:23:35, skipping insertion in model container [2023-02-15 22:23:35,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:35" (2/3) ... [2023-02-15 22:23:35,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffc03a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:23:35, skipping insertion in model container [2023-02-15 22:23:35,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:23:35" (3/3) ... [2023-02-15 22:23:35,937 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal.i [2023-02-15 22:23:35,948 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:23:35,948 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2023-02-15 22:23:35,991 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:23:35,997 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;@7a6ee3b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:23:35,998 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2023-02-15 22:23:36,001 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-15 22:23:36,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:23:36,007 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:23:36,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:23:36,008 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-15 22:23:36,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:23:36,012 INFO L85 PathProgramCache]: Analyzing trace with hash 895333938, now seen corresponding path program 1 times [2023-02-15 22:23:36,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:23:36,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024589315] [2023-02-15 22:23:36,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:36,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:23:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:36,240 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-15 22:23:36,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:23:36,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024589315] [2023-02-15 22:23:36,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024589315] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:23:36,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:23:36,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:23:36,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954631010] [2023-02-15 22:23:36,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:23:36,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:23:36,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:23:36,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:23:36,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:23:36,269 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-15 22:23:36,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:23:36,381 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2023-02-15 22:23:36,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:23:36,383 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-15 22:23:36,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:23:36,390 INFO L225 Difference]: With dead ends: 128 [2023-02-15 22:23:36,390 INFO L226 Difference]: Without dead ends: 125 [2023-02-15 22:23:36,391 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-15 22:23:36,394 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-15 22:23:36,395 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-15 22:23:36,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-15 22:23:36,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-02-15 22:23:36,427 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-15 22:23:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2023-02-15 22:23:36,436 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 6 [2023-02-15 22:23:36,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:23:36,436 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2023-02-15 22:23:36,437 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-15 22:23:36,437 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2023-02-15 22:23:36,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:23:36,437 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:23:36,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:23:36,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:23:36,439 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-15 22:23:36,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:23:36,440 INFO L85 PathProgramCache]: Analyzing trace with hash 895333939, now seen corresponding path program 1 times [2023-02-15 22:23:36,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:23:36,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977716899] [2023-02-15 22:23:36,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:36,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:23:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:36,574 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-15 22:23:36,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:23:36,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977716899] [2023-02-15 22:23:36,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977716899] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:23:36,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:23:36,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:23:36,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782291477] [2023-02-15 22:23:36,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:23:36,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:23:36,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:23:36,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:23:36,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:23:36,579 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-15 22:23:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:23:36,662 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2023-02-15 22:23:36,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:23:36,663 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-15 22:23:36,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:23:36,668 INFO L225 Difference]: With dead ends: 122 [2023-02-15 22:23:36,668 INFO L226 Difference]: Without dead ends: 122 [2023-02-15 22:23:36,671 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-15 22:23:36,672 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-15 22:23:36,672 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-15 22:23:36,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-15 22:23:36,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-02-15 22:23:36,676 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-15 22:23:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2023-02-15 22:23:36,677 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 6 [2023-02-15 22:23:36,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:23:36,677 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2023-02-15 22:23:36,678 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-15 22:23:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2023-02-15 22:23:36,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 22:23:36,678 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:23:36,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:23:36,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:23:36,678 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-15 22:23:36,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:23:36,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1787864811, now seen corresponding path program 1 times [2023-02-15 22:23:36,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:23:36,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106199895] [2023-02-15 22:23:36,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:36,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:23:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:36,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:23:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:36,767 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-15 22:23:36,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:23:36,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106199895] [2023-02-15 22:23:36,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106199895] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:23:36,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:23:36,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:23:36,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132944043] [2023-02-15 22:23:36,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:23:36,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:23:36,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:23:36,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:23:36,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:23:36,770 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-15 22:23:36,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:23:36,851 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2023-02-15 22:23:36,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:23:36,851 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-15 22:23:36,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:23:36,852 INFO L225 Difference]: With dead ends: 133 [2023-02-15 22:23:36,852 INFO L226 Difference]: Without dead ends: 133 [2023-02-15 22:23:36,853 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-15 22:23:36,853 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-15 22:23:36,854 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-15 22:23:36,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-15 22:23:36,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2023-02-15 22:23:36,870 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-15 22:23:36,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2023-02-15 22:23:36,872 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 14 [2023-02-15 22:23:36,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:23:36,872 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2023-02-15 22:23:36,872 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-15 22:23:36,873 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2023-02-15 22:23:36,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 22:23:36,873 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:23:36,873 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:23:36,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:23:36,874 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-15 22:23:36,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:23:36,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1282134272, now seen corresponding path program 1 times [2023-02-15 22:23:36,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:23:36,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942644948] [2023-02-15 22:23:36,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:36,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:23:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:37,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:23:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:37,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:23:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:37,082 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-15 22:23:37,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:23:37,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942644948] [2023-02-15 22:23:37,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942644948] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:23:37,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:23:37,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:23:37,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797398718] [2023-02-15 22:23:37,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:23:37,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:23:37,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:23:37,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:23:37,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:23:37,085 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-15 22:23:37,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:23:37,285 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2023-02-15 22:23:37,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:23:37,286 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-15 22:23:37,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:23:37,287 INFO L225 Difference]: With dead ends: 123 [2023-02-15 22:23:37,288 INFO L226 Difference]: Without dead ends: 123 [2023-02-15 22:23:37,288 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-15 22:23:37,292 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-15 22:23:37,293 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-15 22:23:37,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-15 22:23:37,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2023-02-15 22:23:37,306 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-15 22:23:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2023-02-15 22:23:37,308 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 24 [2023-02-15 22:23:37,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:23:37,309 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2023-02-15 22:23:37,309 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-15 22:23:37,310 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2023-02-15 22:23:37,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 22:23:37,310 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:23:37,310 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:23:37,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:23:37,311 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-15 22:23:37,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:23:37,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1282134271, now seen corresponding path program 1 times [2023-02-15 22:23:37,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:23:37,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548875685] [2023-02-15 22:23:37,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:37,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:23:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:37,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:23:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:37,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:23:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:37,524 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-15 22:23:37,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:23:37,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548875685] [2023-02-15 22:23:37,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548875685] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:23:37,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:23:37,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:23:37,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904407480] [2023-02-15 22:23:37,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:23:37,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:23:37,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:23:37,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:23:37,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:23:37,529 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-15 22:23:37,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:23:37,705 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2023-02-15 22:23:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:23:37,706 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-15 22:23:37,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:23:37,707 INFO L225 Difference]: With dead ends: 122 [2023-02-15 22:23:37,710 INFO L226 Difference]: Without dead ends: 122 [2023-02-15 22:23:37,710 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-15 22:23:37,711 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 19 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-15 22:23:37,712 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-15 22:23:37,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-15 22:23:37,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2023-02-15 22:23:37,719 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-15 22:23:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2023-02-15 22:23:37,720 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 24 [2023-02-15 22:23:37,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:23:37,721 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2023-02-15 22:23:37,721 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-15 22:23:37,721 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2023-02-15 22:23:37,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 22:23:37,722 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:23:37,722 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-15 22:23:37,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 22:23:37,722 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-15 22:23:37,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:23:37,723 INFO L85 PathProgramCache]: Analyzing trace with hash 524578273, now seen corresponding path program 1 times [2023-02-15 22:23:37,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:23:37,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174481238] [2023-02-15 22:23:37,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:37,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:23:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:37,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:23:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:37,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:23:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:38,011 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-15 22:23:38,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:23:38,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174481238] [2023-02-15 22:23:38,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174481238] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:23:38,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770886299] [2023-02-15 22:23:38,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:38,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:23:38,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:23:38,049 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-15 22:23:38,059 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-15 22:23:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:38,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 22:23:38,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:23:38,208 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-15 22:23:38,277 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-15 22:23:38,328 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:23:38,329 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-15 22:23:38,340 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-15 22:23:38,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:23:38,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770886299] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:23:38,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:23:38,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2023-02-15 22:23:38,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655065195] [2023-02-15 22:23:38,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:23:38,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:23:38,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:23:38,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:23:38,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2023-02-15 22:23:38,415 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-15 22:23:38,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:23:38,679 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2023-02-15 22:23:38,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:23:38,679 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-15 22:23:38,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:23:38,680 INFO L225 Difference]: With dead ends: 146 [2023-02-15 22:23:38,681 INFO L226 Difference]: Without dead ends: 146 [2023-02-15 22:23:38,682 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-15 22:23:38,682 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.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:23:38,682 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.2s Time] [2023-02-15 22:23:38,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-15 22:23:38,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2023-02-15 22:23:38,685 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-15 22:23:38,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2023-02-15 22:23:38,686 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 26 [2023-02-15 22:23:38,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:23:38,686 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2023-02-15 22:23:38,686 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-15 22:23:38,686 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2023-02-15 22:23:38,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 22:23:38,687 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:23:38,687 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-15 22:23:38,696 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-15 22:23:38,893 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-15 22:23:38,893 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-15 22:23:38,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:23:38,894 INFO L85 PathProgramCache]: Analyzing trace with hash 524578274, now seen corresponding path program 1 times [2023-02-15 22:23:38,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:23:38,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668355667] [2023-02-15 22:23:38,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:38,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:23:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:39,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:23:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:39,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:23:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:39,218 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-15 22:23:39,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:23:39,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668355667] [2023-02-15 22:23:39,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668355667] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:23:39,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468484578] [2023-02-15 22:23:39,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:39,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:23:39,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:23:39,237 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-15 22:23:39,264 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-15 22:23:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:39,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-15 22:23:39,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:23:39,385 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-15 22:23:39,389 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-15 22:23:39,466 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-15 22:23:39,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:23:39,504 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-15 22:23:39,511 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:23:39,511 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-15 22:23:39,520 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-15 22:23:39,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:23:43,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468484578] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:23:43,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:23:43,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2023-02-15 22:23:43,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218003170] [2023-02-15 22:23:43,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:23:43,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:23:43,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:23:43,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:23:43,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=173, Unknown=1, NotChecked=26, Total=240 [2023-02-15 22:23:43,647 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-15 22:23:43,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:23:43,912 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2023-02-15 22:23:43,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:23:43,913 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-15 22:23:43,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:23:43,913 INFO L225 Difference]: With dead ends: 128 [2023-02-15 22:23:43,914 INFO L226 Difference]: Without dead ends: 128 [2023-02-15 22:23:43,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=56, Invalid=219, Unknown=1, NotChecked=30, Total=306 [2023-02-15 22:23:43,914 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.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:23:43,914 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.2s Time] [2023-02-15 22:23:43,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-15 22:23:43,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2023-02-15 22:23:43,916 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-15 22:23:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2023-02-15 22:23:43,916 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 26 [2023-02-15 22:23:43,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:23:43,917 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2023-02-15 22:23:43,917 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-15 22:23:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2023-02-15 22:23:43,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 22:23:43,917 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:23:43,917 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-15 22:23:43,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 22:23:44,125 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-15 22:23:44,126 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-15 22:23:44,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:23:44,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1608700855, now seen corresponding path program 1 times [2023-02-15 22:23:44,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:23:44,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986439378] [2023-02-15 22:23:44,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:44,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:23:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:44,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:23:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:44,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:23:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:44,247 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-15 22:23:44,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:23:44,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986439378] [2023-02-15 22:23:44,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986439378] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:23:44,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795264959] [2023-02-15 22:23:44,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:44,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:23:44,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:23:44,249 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-15 22:23:44,286 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-15 22:23:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:44,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:23:44,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:23:44,422 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-15 22:23:44,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:23:44,481 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-15 22:23:44,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795264959] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:23:44,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:23:44,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-02-15 22:23:44,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875217787] [2023-02-15 22:23:44,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:23:44,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:23:44,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:23:44,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:23:44,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:23:44,484 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-15 22:23:44,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:23:44,596 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2023-02-15 22:23:44,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:23:44,597 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-15 22:23:44,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:23:44,599 INFO L225 Difference]: With dead ends: 127 [2023-02-15 22:23:44,599 INFO L226 Difference]: Without dead ends: 127 [2023-02-15 22:23:44,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:23:44,600 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-15 22:23:44,600 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-15 22:23:44,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-15 22:23:44,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2023-02-15 22:23:44,602 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-15 22:23:44,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2023-02-15 22:23:44,604 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 28 [2023-02-15 22:23:44,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:23:44,604 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2023-02-15 22:23:44,604 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-15 22:23:44,604 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2023-02-15 22:23:44,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 22:23:44,606 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:23:44,606 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-15 22:23:44,613 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-15 22:23:44,813 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-15 22:23:44,814 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-15 22:23:44,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:23:44,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1674661710, now seen corresponding path program 1 times [2023-02-15 22:23:44,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:23:44,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16780623] [2023-02-15 22:23:44,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:44,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:23:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:44,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:23:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:44,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:23:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:44,908 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-15 22:23:44,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:23:44,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16780623] [2023-02-15 22:23:44,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16780623] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:23:44,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485340920] [2023-02-15 22:23:44,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:44,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:23:44,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:23:44,910 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-15 22:23:44,913 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-15 22:23:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:45,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 22:23:45,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:23:45,030 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-15 22:23:45,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:23:45,041 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:23:45,041 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-15 22:23:45,055 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-15 22:23:45,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485340920] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:23:45,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:23:45,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2023-02-15 22:23:45,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871930688] [2023-02-15 22:23:45,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:23:45,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:23:45,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:23:45,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:23:45,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:23:45,057 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-15 22:23:45,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:23:45,208 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2023-02-15 22:23:45,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:23:45,209 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-15 22:23:45,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:23:45,209 INFO L225 Difference]: With dead ends: 131 [2023-02-15 22:23:45,209 INFO L226 Difference]: Without dead ends: 131 [2023-02-15 22:23:45,209 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-15 22:23:45,210 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:23:45,210 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.1s Time] [2023-02-15 22:23:45,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-15 22:23:45,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2023-02-15 22:23:45,212 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-15 22:23:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2023-02-15 22:23:45,212 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 29 [2023-02-15 22:23:45,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:23:45,212 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2023-02-15 22:23:45,212 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-15 22:23:45,212 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2023-02-15 22:23:45,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 22:23:45,213 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:23:45,213 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-15 22:23:45,219 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-15 22:23:45,418 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-15 22:23:45,419 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-15 22:23:45,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:23:45,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1674661709, now seen corresponding path program 1 times [2023-02-15 22:23:45,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:23:45,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831870402] [2023-02-15 22:23:45,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:45,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:23:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:45,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:23:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:45,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:23:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:45,625 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-15 22:23:45,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:23:45,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831870402] [2023-02-15 22:23:45,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831870402] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:23:45,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127949463] [2023-02-15 22:23:45,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:45,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:23:45,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:23:45,628 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-15 22:23:45,647 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-15 22:23:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:45,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 22:23:45,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:23:45,830 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-15 22:23:45,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:23:45,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:23:45,858 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-15 22:23:45,961 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-15 22:23:45,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127949463] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:23:45,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:23:45,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2023-02-15 22:23:45,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149070168] [2023-02-15 22:23:45,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:23:45,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 22:23:45,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:23:45,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 22:23:45,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-02-15 22:23:45,963 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-15 22:23:46,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:23:46,187 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2023-02-15 22:23:46,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:23:46,188 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-15 22:23:46,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:23:46,188 INFO L225 Difference]: With dead ends: 136 [2023-02-15 22:23:46,188 INFO L226 Difference]: Without dead ends: 136 [2023-02-15 22:23:46,189 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-15 22:23:46,189 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-15 22:23:46,189 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-15 22:23:46,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-15 22:23:46,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2023-02-15 22:23:46,191 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-15 22:23:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2023-02-15 22:23:46,191 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 29 [2023-02-15 22:23:46,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:23:46,192 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2023-02-15 22:23:46,192 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-15 22:23:46,192 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2023-02-15 22:23:46,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 22:23:46,192 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:23:46,192 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-15 22:23:46,197 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-15 22:23:46,397 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-15 22:23:46,398 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-15 22:23:46,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:23:46,398 INFO L85 PathProgramCache]: Analyzing trace with hash -374905453, now seen corresponding path program 1 times [2023-02-15 22:23:46,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:23:46,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694036703] [2023-02-15 22:23:46,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:46,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:23:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:46,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:23:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:46,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:23:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:46,489 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-15 22:23:46,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:23:46,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694036703] [2023-02-15 22:23:46,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694036703] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:23:46,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:23:46,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 22:23:46,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042485148] [2023-02-15 22:23:46,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:23:46,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:23:46,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:23:46,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:23:46,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:23:46,491 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-15 22:23:46,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:23:46,730 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2023-02-15 22:23:46,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:23:46,731 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-15 22:23:46,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:23:46,731 INFO L225 Difference]: With dead ends: 129 [2023-02-15 22:23:46,731 INFO L226 Difference]: Without dead ends: 129 [2023-02-15 22:23:46,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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-15 22:23:46,732 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-15 22:23:46,732 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-15 22:23:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-15 22:23:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2023-02-15 22:23:46,734 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-15 22:23:46,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2023-02-15 22:23:46,734 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 30 [2023-02-15 22:23:46,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:23:46,734 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2023-02-15 22:23:46,734 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-15 22:23:46,734 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2023-02-15 22:23:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 22:23:46,735 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:23:46,735 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-15 22:23:46,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 22:23:46,735 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-15 22:23:46,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:23:46,735 INFO L85 PathProgramCache]: Analyzing trace with hash -374905452, now seen corresponding path program 1 times [2023-02-15 22:23:46,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:23:46,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142983463] [2023-02-15 22:23:46,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:46,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:23:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:46,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:23:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:46,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:23:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:46,886 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-15 22:23:46,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:23:46,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142983463] [2023-02-15 22:23:46,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142983463] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:23:46,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:23:46,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 22:23:46,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262168036] [2023-02-15 22:23:46,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:23:46,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:23:46,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:23:46,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:23:46,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:23:46,888 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-15 22:23:47,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:23:47,083 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2023-02-15 22:23:47,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:23:47,083 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-15 22:23:47,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:23:47,084 INFO L225 Difference]: With dead ends: 127 [2023-02-15 22:23:47,084 INFO L226 Difference]: Without dead ends: 127 [2023-02-15 22:23:47,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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-15 22:23:47,085 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 20 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-15 22:23:47,085 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-15 22:23:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-15 22:23:47,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-02-15 22:23:47,086 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-15 22:23:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2023-02-15 22:23:47,087 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 30 [2023-02-15 22:23:47,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:23:47,087 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2023-02-15 22:23:47,087 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-15 22:23:47,087 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2023-02-15 22:23:47,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:23:47,087 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:23:47,087 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-15 22:23:47,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 22:23:47,088 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-15 22:23:47,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:23:47,088 INFO L85 PathProgramCache]: Analyzing trace with hash -688454360, now seen corresponding path program 1 times [2023-02-15 22:23:47,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:23:47,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312386338] [2023-02-15 22:23:47,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:47,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:23:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:47,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:23:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:47,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:23:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:47,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-15 22:23:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:47,211 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-15 22:23:47,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:23:47,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312386338] [2023-02-15 22:23:47,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312386338] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:23:47,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920023983] [2023-02-15 22:23:47,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:47,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:23:47,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:23:47,226 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-15 22:23:47,251 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-15 22:23:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:47,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:23:47,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:23:47,384 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-15 22:23:47,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:23:47,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920023983] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:23:47,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:23:47,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-02-15 22:23:47,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573865517] [2023-02-15 22:23:47,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:23:47,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:23:47,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:23:47,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:23:47,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:23:47,386 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-15 22:23:47,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:23:47,395 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2023-02-15 22:23:47,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:23:47,396 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-15 22:23:47,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:23:47,396 INFO L225 Difference]: With dead ends: 115 [2023-02-15 22:23:47,396 INFO L226 Difference]: Without dead ends: 115 [2023-02-15 22:23:47,396 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-15 22:23:47,397 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-15 22:23:47,397 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-15 22:23:47,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-15 22:23:47,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-02-15 22:23:47,400 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-15 22:23:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2023-02-15 22:23:47,401 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 41 [2023-02-15 22:23:47,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:23:47,401 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2023-02-15 22:23:47,401 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-15 22:23:47,401 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2023-02-15 22:23:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 22:23:47,402 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:23:47,402 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-15 22:23:47,419 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-15 22:23:47,608 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-15 22:23:47,608 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-15 22:23:47,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:23:47,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1191008248, now seen corresponding path program 1 times [2023-02-15 22:23:47,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:23:47,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481746856] [2023-02-15 22:23:47,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:47,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:23:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:47,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:23:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:47,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:23:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:47,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:23:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:47,940 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-15 22:23:47,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:23:47,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481746856] [2023-02-15 22:23:47,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481746856] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:23:47,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018216356] [2023-02-15 22:23:47,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:47,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:23:47,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:23:47,957 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-15 22:23:47,973 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-15 22:23:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:48,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 22:23:48,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:23:48,133 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-15 22:23:48,142 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-15 22:23:48,152 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1583 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1583))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2023-02-15 22:23:48,168 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1583 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1583)))) is different from true [2023-02-15 22:23:48,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:23:48,176 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-15 22:23:48,206 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-15 22:23:48,221 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:23:48,222 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-15 22:23:48,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:23:48,347 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-02-15 22:23:48,348 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-15 22:23:48,368 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-15 22:23:48,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:23:48,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018216356] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:23:48,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:23:48,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2023-02-15 22:23:48,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530731537] [2023-02-15 22:23:48,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:23:48,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 22:23:48,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:23:48,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 22:23:48,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=249, Unknown=3, NotChecked=102, Total=420 [2023-02-15 22:23:48,489 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 15 states have internal predecessors, (58), 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-15 22:23:48,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:23:48,880 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2023-02-15 22:23:48,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:23:48,882 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 15 states have internal predecessors, (58), 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-15 22:23:48,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:23:48,883 INFO L225 Difference]: With dead ends: 125 [2023-02-15 22:23:48,883 INFO L226 Difference]: Without dead ends: 125 [2023-02-15 22:23:48,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=445, Unknown=3, NotChecked=138, Total=702 [2023-02-15 22:23:48,884 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 346 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 382 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:23:48,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 321 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 460 Invalid, 0 Unknown, 382 Unchecked, 0.3s Time] [2023-02-15 22:23:48,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-15 22:23:48,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2023-02-15 22:23:48,888 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-15 22:23:48,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2023-02-15 22:23:48,888 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 43 [2023-02-15 22:23:48,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:23:48,889 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2023-02-15 22:23:48,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 15 states have internal predecessors, (58), 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-15 22:23:48,890 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2023-02-15 22:23:48,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 22:23:48,890 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:23:48,890 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-15 22:23:48,913 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-15 22:23:49,096 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-15 22:23:49,097 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-15 22:23:49,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:23:49,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1191008247, now seen corresponding path program 1 times [2023-02-15 22:23:49,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:23:49,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695005684] [2023-02-15 22:23:49,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:49,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:23:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:49,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:23:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:49,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:23:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:49,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:23:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:49,641 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-15 22:23:49,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:23:49,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695005684] [2023-02-15 22:23:49,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695005684] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:23:49,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963764475] [2023-02-15 22:23:49,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:49,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:23:49,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:23:49,667 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-15 22:23:49,668 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-15 22:23:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:49,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 22:23:49,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:23:49,835 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-15 22:23:49,854 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-15 22:23:49,869 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-15 22:23:49,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:23:49,900 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-15 22:23:49,911 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-15 22:23:49,917 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-15 22:23:49,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:23:49,942 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-15 22:23:49,998 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-15 22:23:50,003 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-15 22:23:50,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:23:50,033 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-15 22:23:50,049 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-15 22:23:50,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:23:50,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963764475] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:23:50,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:23:50,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2023-02-15 22:23:50,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979364584] [2023-02-15 22:23:50,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:23:50,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 22:23:50,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:23:50,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 22:23:50,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=287, Unknown=3, NotChecked=108, Total=462 [2023-02-15 22:23:50,155 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-15 22:23:50,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:23:50,500 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2023-02-15 22:23:50,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:23:50,501 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-15 22:23:50,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:23:50,501 INFO L225 Difference]: With dead ends: 117 [2023-02-15 22:23:50,502 INFO L226 Difference]: Without dead ends: 117 [2023-02-15 22:23:50,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=451, Unknown=3, NotChecked=138, Total=702 [2023-02-15 22:23:50,502 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 474 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 294 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:23:50,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 175 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 329 Invalid, 0 Unknown, 294 Unchecked, 0.2s Time] [2023-02-15 22:23:50,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-15 22:23:50,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2023-02-15 22:23:50,505 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-15 22:23:50,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2023-02-15 22:23:50,505 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 43 [2023-02-15 22:23:50,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:23:50,505 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2023-02-15 22:23:50,506 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-15 22:23:50,506 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2023-02-15 22:23:50,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 22:23:50,506 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:23:50,506 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-15 22:23:50,514 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-15 22:23:50,706 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-15 22:23:50,707 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-15 22:23:50,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:23:50,707 INFO L85 PathProgramCache]: Analyzing trace with hash -2097625015, now seen corresponding path program 1 times [2023-02-15 22:23:50,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:23:50,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888911655] [2023-02-15 22:23:50,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:50,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:23:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:50,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:23:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:50,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:23:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:50,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:23:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:50,830 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-15 22:23:50,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:23:50,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888911655] [2023-02-15 22:23:50,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888911655] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:23:50,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:23:50,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:23:50,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827127037] [2023-02-15 22:23:50,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:23:50,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:23:50,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:23:50,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:23:50,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:23:50,832 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-15 22:23:51,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:23:51,005 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2023-02-15 22:23:51,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:23:51,006 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-15 22:23:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:23:51,006 INFO L225 Difference]: With dead ends: 113 [2023-02-15 22:23:51,006 INFO L226 Difference]: Without dead ends: 113 [2023-02-15 22:23:51,007 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-15 22:23:51,007 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.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:23:51,007 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.2s Time] [2023-02-15 22:23:51,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-15 22:23:51,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2023-02-15 22:23:51,009 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-15 22:23:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2023-02-15 22:23:51,010 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 45 [2023-02-15 22:23:51,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:23:51,010 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2023-02-15 22:23:51,010 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-15 22:23:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2023-02-15 22:23:51,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 22:23:51,011 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:23:51,011 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-15 22:23:51,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 22:23:51,012 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-15 22:23:51,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:23:51,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2097625014, now seen corresponding path program 1 times [2023-02-15 22:23:51,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:23:51,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194774891] [2023-02-15 22:23:51,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:51,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:23:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:51,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:23:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:51,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:23:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:51,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:23:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:51,219 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-15 22:23:51,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:23:51,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194774891] [2023-02-15 22:23:51,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194774891] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:23:51,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:23:51,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:23:51,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178303333] [2023-02-15 22:23:51,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:23:51,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:23:51,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:23:51,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:23:51,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:23:51,222 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-15 22:23:51,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:23:51,376 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2023-02-15 22:23:51,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:23:51,376 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-15 22:23:51,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:23:51,377 INFO L225 Difference]: With dead ends: 91 [2023-02-15 22:23:51,377 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 22:23:51,377 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-15 22:23:51,378 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-15 22:23:51,378 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-15 22:23:51,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 22:23:51,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-15 22:23:51,386 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-15 22:23:51,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2023-02-15 22:23:51,390 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 45 [2023-02-15 22:23:51,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:23:51,390 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2023-02-15 22:23:51,391 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-15 22:23:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2023-02-15 22:23:51,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:23:51,391 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:23:51,391 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-15 22:23:51,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 22:23:51,391 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-15 22:23:51,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:23:51,392 INFO L85 PathProgramCache]: Analyzing trace with hash -601855080, now seen corresponding path program 1 times [2023-02-15 22:23:51,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:23:51,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525004295] [2023-02-15 22:23:51,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:51,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:23:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:51,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:23:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:51,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:23:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:51,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:23:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:51,958 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-15 22:23:51,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:23:51,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525004295] [2023-02-15 22:23:51,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525004295] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:23:51,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218551586] [2023-02-15 22:23:51,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:51,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:23:51,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:23:51,960 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-15 22:23:51,962 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-15 22:23:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:52,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-15 22:23:52,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:23:52,193 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-15 22:23:52,371 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-15 22:23:52,471 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-15 22:23:52,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:23:52,486 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-15 22:23:52,494 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 22:23:52,494 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-15 22:23:52,543 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-15 22:23:52,552 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-15 22:23:52,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:23:52,596 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-15 22:23:52,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218551586] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:23:52,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:23:52,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2023-02-15 22:23:52,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066632309] [2023-02-15 22:23:52,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:23:52,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-15 22:23:52,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:23:52,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-15 22:23:52,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=573, Unknown=3, NotChecked=98, Total=756 [2023-02-15 22:23:52,598 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-15 22:23:53,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:23:53,142 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2023-02-15 22:23:53,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 22:23:53,142 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-15 22:23:53,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:23:53,151 INFO L225 Difference]: With dead ends: 108 [2023-02-15 22:23:53,152 INFO L226 Difference]: Without dead ends: 108 [2023-02-15 22:23:53,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=952, Unknown=5, NotChecked=130, Total=1260 [2023-02-15 22:23:53,153 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 340 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:23:53,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 511 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 772 Invalid, 3 Unknown, 93 Unchecked, 0.4s Time] [2023-02-15 22:23:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-15 22:23:53,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2023-02-15 22:23:53,154 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-15 22:23:53,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2023-02-15 22:23:53,155 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 46 [2023-02-15 22:23:53,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:23:53,155 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2023-02-15 22:23:53,155 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-15 22:23:53,155 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2023-02-15 22:23:53,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:23:53,155 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:23:53,155 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-15 22:23:53,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-15 22:23:53,361 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-15 22:23:53,361 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-15 22:23:53,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:23:53,362 INFO L85 PathProgramCache]: Analyzing trace with hash -601855079, now seen corresponding path program 1 times [2023-02-15 22:23:53,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:23:53,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869445635] [2023-02-15 22:23:53,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:53,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:23:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:53,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:23:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:53,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:23:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:53,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:23:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:54,132 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-15 22:23:54,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:23:54,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869445635] [2023-02-15 22:23:54,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869445635] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:23:54,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931123645] [2023-02-15 22:23:54,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:54,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:23:54,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:23:54,134 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-15 22:23:54,151 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-15 22:23:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:54,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 63 conjunts are in the unsatisfiable core [2023-02-15 22:23:54,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:23:54,357 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-15 22:23:54,361 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-15 22:23:54,703 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-15 22:23:54,711 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-15 22:23:54,868 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-15 22:23:54,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:23:54,919 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-15 22:23:54,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:23:54,925 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-15 22:23:54,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:23:54,939 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-15 22:23:54,946 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:23:54,947 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-15 22:23:54,997 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-15 22:23:54,998 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-15 22:23:55,025 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-15 22:23:55,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:23:55,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931123645] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:23:55,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:23:55,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2023-02-15 22:23:55,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929122375] [2023-02-15 22:23:55,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:23:55,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 22:23:55,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:23:55,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 22:23:55,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=961, Unknown=2, NotChecked=62, Total=1122 [2023-02-15 22:23:55,238 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-15 22:23:56,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:23:56,428 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2023-02-15 22:23:56,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 22:23:56,429 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-15 22:23:56,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:23:56,429 INFO L225 Difference]: With dead ends: 89 [2023-02-15 22:23:56,429 INFO L226 Difference]: Without dead ends: 89 [2023-02-15 22:23:56,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=221, Invalid=1758, Unknown=5, NotChecked=86, Total=2070 [2023-02-15 22:23:56,430 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 313 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:23:56,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 761 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1033 Invalid, 3 Unknown, 92 Unchecked, 0.6s Time] [2023-02-15 22:23:56,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-15 22:23:56,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-02-15 22:23:56,432 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-15 22:23:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2023-02-15 22:23:56,432 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 46 [2023-02-15 22:23:56,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:23:56,433 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2023-02-15 22:23:56,433 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-15 22:23:56,433 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2023-02-15 22:23:56,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 22:23:56,433 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:23:56,433 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-15 22:23:56,446 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-15 22:23:56,633 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-15 22:23:56,634 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-15 22:23:56,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:23:56,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1437854233, now seen corresponding path program 1 times [2023-02-15 22:23:56,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:23:56,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744723277] [2023-02-15 22:23:56,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:56,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:23:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:57,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:23:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:57,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:23:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:57,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:23:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:57,775 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-15 22:23:57,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:23:57,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744723277] [2023-02-15 22:23:57,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744723277] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:23:57,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154432928] [2023-02-15 22:23:57,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:23:57,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:23:57,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:23:57,789 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-15 22:23:57,795 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-15 22:23:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:23:58,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 86 conjunts are in the unsatisfiable core [2023-02-15 22:23:58,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:23:58,063 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-15 22:23:58,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:23:58,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:23:58,371 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-15 22:23:58,376 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-15 22:23:58,528 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-15 22:23:58,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:23:58,584 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-15 22:23:58,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:23:58,597 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:23:58,597 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-15 22:23:58,622 INFO L321 Elim1Store]: treesize reduction 92, result has 31.9 percent of original size [2023-02-15 22:23:58,623 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-15 22:23:58,725 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-15 22:23:58,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:23:58,784 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-15 22:23:58,866 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-15 22:23:58,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:23:59,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154432928] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:23:59,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:23:59,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 37 [2023-02-15 22:23:59,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778143645] [2023-02-15 22:23:59,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:23:59,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-15 22:23:59,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:23:59,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-15 22:23:59,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1429, Unknown=2, NotChecked=76, Total=1640 [2023-02-15 22:23:59,047 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-15 22:24:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:00,781 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2023-02-15 22:24:00,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 22:24:00,782 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-15 22:24:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:00,783 INFO L225 Difference]: With dead ends: 147 [2023-02-15 22:24:00,783 INFO L226 Difference]: Without dead ends: 147 [2023-02-15 22:24:00,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=364, Invalid=2716, Unknown=4, NotChecked=108, Total=3192 [2023-02-15 22:24:00,784 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 577 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 17 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:00,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 1208 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1475 Invalid, 3 Unknown, 110 Unchecked, 0.9s Time] [2023-02-15 22:24:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-02-15 22:24:00,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 88. [2023-02-15 22:24:00,786 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-15 22:24:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2023-02-15 22:24:00,786 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 48 [2023-02-15 22:24:00,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:00,786 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2023-02-15 22:24:00,786 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-15 22:24:00,786 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2023-02-15 22:24:00,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 22:24:00,786 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:00,786 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-15 22:24:00,793 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-15 22:24:00,992 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-15 22:24:00,993 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-15 22:24:00,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:00,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1437854234, now seen corresponding path program 1 times [2023-02-15 22:24:00,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:00,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466957900] [2023-02-15 22:24:00,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:00,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:02,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:02,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:02,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:02,881 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-15 22:24:02,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:02,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466957900] [2023-02-15 22:24:02,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466957900] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:02,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131361564] [2023-02-15 22:24:02,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:02,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:02,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:24:02,897 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-15 22:24:02,903 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-15 22:24:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:03,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 84 conjunts are in the unsatisfiable core [2023-02-15 22:24:03,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:24:03,187 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-15 22:24:03,466 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-15 22:24:03,471 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-15 22:24:03,623 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-15 22:24:03,623 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-15 22:24:03,632 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-02-15 22:24:03,633 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-15 22:24:03,637 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-15 22:24:03,641 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:24:03,642 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-15 22:24:03,871 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-15 22:24:03,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:03,909 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-15 22:24:03,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:03,920 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:24:03,920 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-15 22:24:03,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:03,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:03,927 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 22:24:03,927 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-15 22:24:03,942 INFO L321 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2023-02-15 22:24:03,943 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-15 22:24:04,068 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-15 22:24:04,068 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-15 22:24:04,075 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-02-15 22:24:04,076 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-15 22:24:04,140 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-15 22:24:04,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:24:04,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131361564] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:04,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:24:04,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 44 [2023-02-15 22:24:04,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822156562] [2023-02-15 22:24:04,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:24:04,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-15 22:24:04,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:04,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-15 22:24:04,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2196, Unknown=2, NotChecked=94, Total=2450 [2023-02-15 22:24:04,536 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-15 22:24:06,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:06,567 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2023-02-15 22:24:06,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 22:24:06,567 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-15 22:24:06,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:06,568 INFO L225 Difference]: With dead ends: 130 [2023-02-15 22:24:06,568 INFO L226 Difference]: Without dead ends: 130 [2023-02-15 22:24:06,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=349, Invalid=3943, Unknown=2, NotChecked=128, Total=4422 [2023-02-15 22:24:06,569 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 220 mSDsluCounter, 1861 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 2569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:06,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1945 Invalid, 2569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2471 Invalid, 0 Unknown, 90 Unchecked, 1.2s Time] [2023-02-15 22:24:06,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-15 22:24:06,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 87. [2023-02-15 22:24:06,571 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-15 22:24:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2023-02-15 22:24:06,571 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 48 [2023-02-15 22:24:06,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:06,571 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2023-02-15 22:24:06,571 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-15 22:24:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2023-02-15 22:24:06,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 22:24:06,572 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:06,572 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-15 22:24:06,580 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-15 22:24:06,778 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-15 22:24:06,778 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-15 22:24:06,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:06,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2081433199, now seen corresponding path program 1 times [2023-02-15 22:24:06,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:06,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181467780] [2023-02-15 22:24:06,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:06,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:06,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:06,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:06,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:07,017 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-15 22:24:07,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:07,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181467780] [2023-02-15 22:24:07,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181467780] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:24:07,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:24:07,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 22:24:07,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213147300] [2023-02-15 22:24:07,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:24:07,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:24:07,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:07,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:24:07,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:24:07,019 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-15 22:24:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:07,234 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2023-02-15 22:24:07,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 22:24:07,236 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-15 22:24:07,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:07,237 INFO L225 Difference]: With dead ends: 150 [2023-02-15 22:24:07,237 INFO L226 Difference]: Without dead ends: 150 [2023-02-15 22:24:07,237 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-15 22:24:07,237 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 264 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:07,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 391 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:24:07,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-15 22:24:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 90. [2023-02-15 22:24:07,239 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-15 22:24:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2023-02-15 22:24:07,239 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 51 [2023-02-15 22:24:07,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:07,239 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2023-02-15 22:24:07,240 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-15 22:24:07,240 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2023-02-15 22:24:07,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 22:24:07,240 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:07,240 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-15 22:24:07,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-15 22:24:07,240 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-15 22:24:07,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:07,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2081433198, now seen corresponding path program 1 times [2023-02-15 22:24:07,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:07,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3316487] [2023-02-15 22:24:07,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:07,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:07,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:07,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:07,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:07,556 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-15 22:24:07,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:07,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3316487] [2023-02-15 22:24:07,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3316487] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:24:07,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:24:07,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 22:24:07,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497229487] [2023-02-15 22:24:07,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:24:07,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:24:07,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:07,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:24:07,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:24:07,558 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-15 22:24:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:07,761 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2023-02-15 22:24:07,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:24:07,762 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-15 22:24:07,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:07,762 INFO L225 Difference]: With dead ends: 132 [2023-02-15 22:24:07,762 INFO L226 Difference]: Without dead ends: 132 [2023-02-15 22:24:07,762 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-15 22:24:07,763 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-15 22:24:07,763 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-15 22:24:07,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-02-15 22:24:07,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 92. [2023-02-15 22:24:07,764 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-15 22:24:07,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2023-02-15 22:24:07,765 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 51 [2023-02-15 22:24:07,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:07,765 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2023-02-15 22:24:07,765 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-15 22:24:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2023-02-15 22:24:07,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 22:24:07,765 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:07,765 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-15 22:24:07,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-15 22:24:07,765 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-15 22:24:07,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:07,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1197458036, now seen corresponding path program 1 times [2023-02-15 22:24:07,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:07,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141579794] [2023-02-15 22:24:07,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:07,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:07,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:07,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:08,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:08,142 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-15 22:24:08,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:08,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141579794] [2023-02-15 22:24:08,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141579794] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:08,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201558638] [2023-02-15 22:24:08,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:08,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:08,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:24:08,144 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-15 22:24:08,146 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-15 22:24:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:08,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 22:24:08,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:24:08,642 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-15 22:24:08,724 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-15 22:24:08,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:08,744 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-15 22:24:08,770 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-15 22:24:08,797 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-15 22:24:08,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:24:08,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201558638] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:08,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:24:08,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-02-15 22:24:08,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148930950] [2023-02-15 22:24:08,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:24:08,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 22:24:08,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:08,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 22:24:08,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=616, Unknown=3, NotChecked=50, Total=756 [2023-02-15 22:24:08,907 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-15 22:24:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:09,313 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2023-02-15 22:24:09,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 22:24:09,314 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-15 22:24:09,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:09,315 INFO L225 Difference]: With dead ends: 83 [2023-02-15 22:24:09,315 INFO L226 Difference]: Without dead ends: 83 [2023-02-15 22:24:09,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=958, Unknown=3, NotChecked=64, Total=1190 [2023-02-15 22:24:09,316 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 212 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:09,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 483 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 349 Invalid, 0 Unknown, 85 Unchecked, 0.2s Time] [2023-02-15 22:24:09,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-15 22:24:09,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-02-15 22:24:09,320 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-15 22:24:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2023-02-15 22:24:09,320 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 53 [2023-02-15 22:24:09,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:09,320 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2023-02-15 22:24:09,320 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-15 22:24:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2023-02-15 22:24:09,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 22:24:09,323 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:09,323 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-15 22:24:09,334 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-15 22:24:09,530 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-15 22:24:09,530 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-15 22:24:09,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:09,531 INFO L85 PathProgramCache]: Analyzing trace with hash -422730206, now seen corresponding path program 1 times [2023-02-15 22:24:09,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:09,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260938212] [2023-02-15 22:24:09,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:09,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:10,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:10,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:10,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:10,366 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-15 22:24:10,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:10,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260938212] [2023-02-15 22:24:10,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260938212] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:10,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746744905] [2023-02-15 22:24:10,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:10,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:10,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:24:10,368 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-15 22:24:10,404 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-15 22:24:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:10,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 22:24:10,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:24:10,691 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-15 22:24:10,902 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 22:24:10,903 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-15 22:24:10,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:10,973 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 22:24:10,973 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-15 22:24:10,978 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-15 22:24:10,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:10,989 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-15 22:24:11,028 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-15 22:24:11,041 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-15 22:24:11,042 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:24:11,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746744905] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:24:11,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:24:11,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [22] total 32 [2023-02-15 22:24:11,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854884742] [2023-02-15 22:24:11,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:24:11,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 22:24:11,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:11,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 22:24:11,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2023-02-15 22:24:11,043 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-15 22:24:11,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:11,372 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2023-02-15 22:24:11,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 22:24:11,372 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-15 22:24:11,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:11,373 INFO L225 Difference]: With dead ends: 100 [2023-02-15 22:24:11,373 INFO L226 Difference]: Without dead ends: 100 [2023-02-15 22:24:11,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=240, Invalid=1566, Unknown=0, NotChecked=0, Total=1806 [2023-02-15 22:24:11,374 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 208 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:11,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 302 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:24:11,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-15 22:24:11,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2023-02-15 22:24:11,376 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-15 22:24:11,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2023-02-15 22:24:11,376 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 54 [2023-02-15 22:24:11,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:11,377 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2023-02-15 22:24:11,377 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-15 22:24:11,377 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2023-02-15 22:24:11,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 22:24:11,377 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:11,377 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-15 22:24:11,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 22:24:11,577 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-15 22:24:11,578 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-15 22:24:11,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:11,578 INFO L85 PathProgramCache]: Analyzing trace with hash -422730205, now seen corresponding path program 1 times [2023-02-15 22:24:11,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:11,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194133933] [2023-02-15 22:24:11,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:11,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:12,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:12,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:12,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:12,964 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-15 22:24:12,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:12,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194133933] [2023-02-15 22:24:12,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194133933] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:24:12,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:24:12,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-02-15 22:24:12,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728143849] [2023-02-15 22:24:12,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:24:12,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 22:24:12,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:12,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 22:24:12,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2023-02-15 22:24:12,966 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-15 22:24:13,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:13,398 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2023-02-15 22:24:13,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 22:24:13,399 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-15 22:24:13,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:13,399 INFO L225 Difference]: With dead ends: 81 [2023-02-15 22:24:13,399 INFO L226 Difference]: Without dead ends: 81 [2023-02-15 22:24:13,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2023-02-15 22:24:13,400 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 435 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:13,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 356 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:24:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-15 22:24:13,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-02-15 22:24:13,401 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-15 22:24:13,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-02-15 22:24:13,402 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 54 [2023-02-15 22:24:13,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:13,402 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-02-15 22:24:13,402 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-15 22:24:13,402 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-02-15 22:24:13,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 22:24:13,402 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:13,402 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-15 22:24:13,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-15 22:24:13,402 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-15 22:24:13,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:13,403 INFO L85 PathProgramCache]: Analyzing trace with hash -755022309, now seen corresponding path program 1 times [2023-02-15 22:24:13,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:13,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697787046] [2023-02-15 22:24:13,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:13,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:14,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:14,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:14,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:14,465 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-15 22:24:14,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:14,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697787046] [2023-02-15 22:24:14,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697787046] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:24:14,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:24:14,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2023-02-15 22:24:14,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216425472] [2023-02-15 22:24:14,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:24:14,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-15 22:24:14,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:14,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 22:24:14,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2023-02-15 22:24:14,468 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-15 22:24:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:15,270 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2023-02-15 22:24:15,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 22:24:15,271 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-15 22:24:15,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:15,271 INFO L225 Difference]: With dead ends: 103 [2023-02-15 22:24:15,271 INFO L226 Difference]: Without dead ends: 103 [2023-02-15 22:24:15,272 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-15 22:24:15,272 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 505 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:15,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 535 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:24:15,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-15 22:24:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2023-02-15 22:24:15,273 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-15 22:24:15,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2023-02-15 22:24:15,273 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 59 [2023-02-15 22:24:15,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:15,274 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2023-02-15 22:24:15,274 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-15 22:24:15,274 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2023-02-15 22:24:15,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 22:24:15,274 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:15,274 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-15 22:24:15,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-02-15 22:24:15,274 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-15 22:24:15,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:15,275 INFO L85 PathProgramCache]: Analyzing trace with hash -755022308, now seen corresponding path program 1 times [2023-02-15 22:24:15,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:15,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671408164] [2023-02-15 22:24:15,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:15,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:16,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:16,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:16,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:17,358 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-15 22:24:17,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:17,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671408164] [2023-02-15 22:24:17,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671408164] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:17,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903252019] [2023-02-15 22:24:17,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:17,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:17,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:24:17,361 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-15 22:24:17,361 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-15 22:24:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:17,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 128 conjunts are in the unsatisfiable core [2023-02-15 22:24:17,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:24:17,647 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-15 22:24:17,677 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-15 22:24:17,786 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:24:17,786 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-15 22:24:17,875 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-15 22:24:17,879 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-15 22:24:17,992 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:24:17,992 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-15 22:24:18,342 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-15 22:24:18,346 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-15 22:24:18,350 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-15 22:24:18,354 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-15 22:24:18,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:18,723 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-15 22:24:18,733 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 22:24:18,734 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-15 22:24:18,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:18,747 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:24:18,747 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-15 22:24:18,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:18,753 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-15 22:24:18,988 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 22:24:18,988 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-15 22:24:19,000 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 22:24:19,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 22:24:19,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:19,158 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 22:24:19,158 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-15 22:24:19,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:19,171 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 22:24:19,171 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-15 22:24:19,195 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-15 22:24:19,247 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-15 22:24:19,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:19,408 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-15 22:24:19,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:19,412 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-15 22:24:19,671 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:24:19,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 85 [2023-02-15 22:24:19,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:19,689 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-15 22:24:19,829 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-15 22:24:19,832 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-15 22:24:19,957 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-15 22:24:19,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:24:20,208 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-15 22:24:20,222 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-15 22:24:20,244 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-15 22:24:20,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903252019] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:20,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:24:20,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2023-02-15 22:24:20,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30260070] [2023-02-15 22:24:20,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:24:20,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-15 22:24:20,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:20,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-15 22:24:20,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2908, Unknown=87, NotChecked=336, Total=3540 [2023-02-15 22:24:20,815 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-15 22:24:24,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:24,218 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2023-02-15 22:24:24,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 22:24:24,219 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-15 22:24:24,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:24,219 INFO L225 Difference]: With dead ends: 105 [2023-02-15 22:24:24,219 INFO L226 Difference]: Without dead ends: 105 [2023-02-15 22:24:24,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=621, Invalid=5294, Unknown=103, NotChecked=462, Total=6480 [2023-02-15 22:24:24,221 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 865 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 34 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:24,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 868 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1856 Invalid, 2 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 22:24:24,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-15 22:24:24,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2023-02-15 22:24:24,222 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-15 22:24:24,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2023-02-15 22:24:24,223 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 59 [2023-02-15 22:24:24,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:24,223 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2023-02-15 22:24:24,223 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-15 22:24:24,223 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2023-02-15 22:24:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-15 22:24:24,223 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:24,223 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-15 22:24:24,230 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-15 22:24:24,424 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-15 22:24:24,424 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-15 22:24:24,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:24,424 INFO L85 PathProgramCache]: Analyzing trace with hash 273036414, now seen corresponding path program 1 times [2023-02-15 22:24:24,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:24,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397175138] [2023-02-15 22:24:24,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:24,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:26,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:27,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:27,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:28,156 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-15 22:24:28,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:28,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397175138] [2023-02-15 22:24:28,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397175138] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:28,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483684619] [2023-02-15 22:24:28,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:28,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:28,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:24:28,157 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-15 22:24:28,158 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-15 22:24:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:28,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 151 conjunts are in the unsatisfiable core [2023-02-15 22:24:28,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:24:28,516 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-15 22:24:28,747 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-15 22:24:28,867 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-15 22:24:29,011 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:24:29,011 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-15 22:24:29,184 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-15 22:24:29,275 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-15 22:24:29,445 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-15 22:24:29,517 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-15 22:24:29,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:29,528 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-15 22:24:29,803 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:24:29,803 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-15 22:24:29,807 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-15 22:24:29,810 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-15 22:24:29,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-15 22:24:30,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:30,290 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:24:30,291 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-15 22:24:30,303 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 22:24:30,303 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-15 22:24:30,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 18 treesize of output 20 [2023-02-15 22:24:30,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:30,324 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-15 22:24:30,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:30,950 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:24:30,974 INFO L321 Elim1Store]: treesize reduction 102, result has 19.0 percent of original size [2023-02-15 22:24:30,974 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 81 [2023-02-15 22:24:30,991 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:24:30,991 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 128 treesize of output 121 [2023-02-15 22:24:31,000 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 32 treesize of output 34 [2023-02-15 22:24:31,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:31,161 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 22:24:31,161 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 115 treesize of output 103 [2023-02-15 22:24:31,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:31,165 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 94 treesize of output 88 [2023-02-15 22:24:31,180 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-15 22:24:31,337 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-15 22:24:31,338 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 219 treesize of output 130 [2023-02-15 22:24:31,359 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:24:31,360 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 182 treesize of output 171 [2023-02-15 22:24:31,370 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 36 treesize of output 38 [2023-02-15 22:24:31,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:31,687 INFO L321 Elim1Store]: treesize reduction 108, result has 25.0 percent of original size [2023-02-15 22:24:31,688 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 199 treesize of output 104 [2023-02-15 22:24:31,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:31,694 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-15 22:24:31,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:31,700 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 50 treesize of output 46 [2023-02-15 22:24:31,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:31,981 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-15 22:24:31,983 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-15 22:24:32,112 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-15 22:24:32,171 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-15 22:24:32,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:24:32,402 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4963 Int) (v_ArrVal_4961 Int) (v_ArrVal_4964 (Array Int Int))) (= (select (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4))) (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) .cse0 v_ArrVal_4963)) (select (select (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|) .cse0 v_ArrVal_4961)) |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_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-15 22:24:32,415 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)) (or (= (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|))) (select (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_10| 4))) (select (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_4963)) (select (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 v_ArrVal_4961)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 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 |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))))) is different from false [2023-02-15 22:24:32,434 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-15 22:24:32,505 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-15 22:24:32,524 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-15 22:24:32,552 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-15 22:24:32,589 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-15 22:24:32,644 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-15 22:24:32,745 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-15 22:24:32,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483684619] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:32,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:24:32,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34] total 70 [2023-02-15 22:24:32,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525463210] [2023-02-15 22:24:32,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:24:32,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-02-15 22:24:32,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:24:32,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-02-15 22:24:32,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=5009, Unknown=17, NotChecked=1350, Total=6642 [2023-02-15 22:24:32,751 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-15 22:24:42,225 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-15 22:24:45,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:24:45,798 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2023-02-15 22:24:45,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-15 22:24:45,800 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-15 22:24:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:24:45,801 INFO L225 Difference]: With dead ends: 103 [2023-02-15 22:24:45,801 INFO L226 Difference]: Without dead ends: 103 [2023-02-15 22:24:45,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 107 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1978 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=825, Invalid=9092, Unknown=19, NotChecked=1836, Total=11772 [2023-02-15 22:24:45,803 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1017 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 90 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 2449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:24:45,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 932 Invalid, 2449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2356 Invalid, 3 Unknown, 0 Unchecked, 3.9s Time] [2023-02-15 22:24:45,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-15 22:24:45,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 84. [2023-02-15 22:24:45,805 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-15 22:24:45,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2023-02-15 22:24:45,806 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 61 [2023-02-15 22:24:45,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:24:45,806 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2023-02-15 22:24:45,806 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-15 22:24:45,806 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2023-02-15 22:24:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-15 22:24:45,807 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:24:45,807 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-15 22:24:45,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-02-15 22:24:46,031 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-15 22:24:46,031 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-15 22:24:46,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:24:46,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1627638346, now seen corresponding path program 1 times [2023-02-15 22:24:46,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:24:46,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678829860] [2023-02-15 22:24:46,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:46,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:24:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:48,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:24:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:48,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:24:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:48,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:24:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:49,508 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-15 22:24:49,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:24:49,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678829860] [2023-02-15 22:24:49,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678829860] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:24:49,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593743215] [2023-02-15 22:24:49,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:24:49,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:24:49,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:24:49,515 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-15 22:24:49,516 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-15 22:24:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:24:49,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 137 conjunts are in the unsatisfiable core [2023-02-15 22:24:49,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:24:49,845 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-15 22:24:49,898 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-15 22:24:50,033 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:24:50,033 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-15 22:24:50,124 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-15 22:24:50,231 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 22:24:50,232 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-15 22:24:50,339 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-15 22:24:50,420 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:24:50,420 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-15 22:24:50,544 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:24:50,544 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-15 22:24:50,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:50,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 43 treesize of output 30 [2023-02-15 22:24:50,746 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:24:50,746 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-15 22:24:50,749 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-15 22:24:50,751 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-15 22:24:51,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:51,074 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-15 22:24:51,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:51,085 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:24:51,085 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-15 22:24:51,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:51,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:51,105 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2023-02-15 22:24:51,105 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-15 22:24:51,643 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2023-02-15 22:24:51,643 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-15 22:24:51,656 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:24:51,657 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-15 22:24:51,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:51,731 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-15 22:24:51,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:51,746 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:24:51,747 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-15 22:24:51,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:51,855 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:24:51,855 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-15 22:24:51,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:24:51,879 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-15 22:24:52,126 INFO L321 Elim1Store]: treesize reduction 62, result has 34.0 percent of original size [2023-02-15 22:24:52,127 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-15 22:24:52,136 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-15 22:24:52,136 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-15 22:24:52,141 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-15 22:24:52,500 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-15 22:24:53,246 INFO L321 Elim1Store]: treesize reduction 132, result has 58.6 percent of original size [2023-02-15 22:24:53,246 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-15 22:25:26,842 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-15 22:25:26,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:25:27,003 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-15 22:25:27,008 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-15 22:25:27,017 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-15 22:25:27,591 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-15 22:25:27,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593743215] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:25:27,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:25:27,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 32] total 70 [2023-02-15 22:25:27,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184686072] [2023-02-15 22:25:27,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:25:27,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-02-15 22:25:27,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:25:27,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-02-15 22:25:27,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=5893, Unknown=6, NotChecked=628, Total=6806 [2023-02-15 22:25:27,595 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-15 22:25:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:25:36,068 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2023-02-15 22:25:36,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-15 22:25:36,069 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-15 22:25:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:25:36,070 INFO L225 Difference]: With dead ends: 135 [2023-02-15 22:25:36,070 INFO L226 Difference]: Without dead ends: 135 [2023-02-15 22:25:36,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 109 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3233 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=857, Invalid=10495, Unknown=6, NotChecked=852, Total=12210 [2023-02-15 22:25:36,072 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1047 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 2574 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:25:36,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 976 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2574 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-02-15 22:25:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-15 22:25:36,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 88. [2023-02-15 22:25:36,073 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-15 22:25:36,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2023-02-15 22:25:36,074 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 65 [2023-02-15 22:25:36,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:25:36,074 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2023-02-15 22:25:36,074 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-15 22:25:36,074 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2023-02-15 22:25:36,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-15 22:25:36,075 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:25:36,075 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-15 22:25:36,082 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-15 22:25:36,282 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-15 22:25:36,282 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-15 22:25:36,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:25:36,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1627638347, now seen corresponding path program 1 times [2023-02-15 22:25:36,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:25:36,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100161085] [2023-02-15 22:25:36,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:25:36,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:25:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:25:39,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:25:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:25:39,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:25:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:25:39,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:25:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:25:40,399 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-15 22:25:40,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:25:40,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100161085] [2023-02-15 22:25:40,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100161085] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:25:40,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771293748] [2023-02-15 22:25:40,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:25:40,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:25:40,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:25:40,401 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-15 22:25:40,406 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-15 22:25:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:25:40,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 185 conjunts are in the unsatisfiable core [2023-02-15 22:25:40,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:25:40,734 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-15 22:25:40,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:25:40,822 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-15 22:25:40,952 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:25:40,953 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-15 22:25:41,089 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-15 22:25:41,093 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-15 22:25:41,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:41,311 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:25:41,312 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-15 22:25:41,319 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-15 22:25:41,506 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-15 22:25:41,525 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-15 22:25:41,652 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:25:41,652 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-15 22:25:41,661 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-15 22:25:41,941 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:25:41,941 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-15 22:25:41,944 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-15 22:25:41,958 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:25:41,958 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-15 22:25:42,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:42,037 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-15 22:25:42,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:42,057 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-15 22:25:42,371 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:25:42,372 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-15 22:25:42,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:42,377 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-15 22:25:42,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:25:42,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:42,386 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 15 treesize of output 7 [2023-02-15 22:25:42,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:42,785 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 22:25:42,786 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-15 22:25:42,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:42,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:42,802 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-02-15 22:25:42,803 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-15 22:25:42,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:42,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:42,845 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 22:25:42,845 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-15 22:25:42,859 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-15 22:25:43,615 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2023-02-15 22:25:43,615 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-15 22:25:43,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:43,650 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 22:25:43,650 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-15 22:25:43,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:43,760 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:25:43,761 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-15 22:25:43,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:43,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:43,777 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-15 22:25:43,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:43,930 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:25:43,931 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-15 22:25:43,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:43,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:43,946 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-15 22:25:44,186 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:25:44,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:44,189 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:25:44,190 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-15 22:25:44,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:44,214 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-02-15 22:25:44,214 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-15 22:25:44,613 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2023-02-15 22:25:44,613 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-15 22:25:44,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:25:44,821 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2023-02-15 22:25:44,821 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-15 22:25:44,896 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-15 22:25:44,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:25:57,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771293748] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:25:57,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:25:57,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 34] total 71 [2023-02-15 22:25:57,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217562394] [2023-02-15 22:25:57,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:25:57,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-02-15 22:25:57,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:25:57,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-02-15 22:25:57,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=7097, Unknown=49, NotChecked=0, Total=7482 [2023-02-15 22:25:57,056 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-15 22:26:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:26:27,884 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2023-02-15 22:26:27,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-15 22:26:27,885 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-15 22:26:27,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:26:27,885 INFO L225 Difference]: With dead ends: 157 [2023-02-15 22:26:27,886 INFO L226 Difference]: Without dead ends: 157 [2023-02-15 22:26:27,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 40 SyntacticMatches, 10 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3312 ImplicationChecksByTransitivity, 36.0s TimeCoverageRelationStatistics Valid=908, Invalid=12153, Unknown=49, NotChecked=0, Total=13110 [2023-02-15 22:26:27,887 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1143 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 2782 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:26:27,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 1084 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2782 Invalid, 0 Unknown, 0 Unchecked, 10.0s Time] [2023-02-15 22:26:27,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-15 22:26:27,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 90. [2023-02-15 22:26:27,888 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-15 22:26:27,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2023-02-15 22:26:27,889 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 65 [2023-02-15 22:26:27,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:26:27,889 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2023-02-15 22:26:27,889 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-15 22:26:27,889 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2023-02-15 22:26:27,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 22:26:27,889 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:26:27,889 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-15 22:26:27,898 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-15 22:26:28,096 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-15 22:26:28,097 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-15 22:26:28,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:26:28,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1082819804, now seen corresponding path program 1 times [2023-02-15 22:26:28,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:26:28,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43158907] [2023-02-15 22:26:28,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:28,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:26:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:34,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:26:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:34,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:26:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:35,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:26:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:36,784 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-15 22:26:36,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:26:36,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43158907] [2023-02-15 22:26:36,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43158907] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:26:36,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642642342] [2023-02-15 22:26:36,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:26:36,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:26:36,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:26:36,785 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-15 22:26:36,788 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-15 22:26:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:26:37,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 145 conjunts are in the unsatisfiable core [2023-02-15 22:26:37,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:26:37,158 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-15 22:26:37,446 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-15 22:26:38,200 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-15 22:26:38,207 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-15 22:26:38,275 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-15 22:26:38,283 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-15 22:26:38,402 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-15 22:26:38,410 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-15 22:26:38,493 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-15 22:26:38,500 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-15 22:26:38,891 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-15 22:26:38,899 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-15 22:26:39,130 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-15 22:26:39,138 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-15 22:26:39,296 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-15 22:26:39,305 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-15 22:26:39,398 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-15 22:26:39,470 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-15 22:26:39,478 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-15 22:26:39,665 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:26:39,666 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-15 22:26:39,811 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-15 22:26:39,820 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-15 22:26:40,013 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-15 22:26:40,022 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-15 22:26:40,242 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:26:40,242 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-15 22:26:40,364 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-15 22:26:40,372 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-15 22:26:40,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:40,464 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-15 22:26:40,534 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-15 22:26:40,542 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-15 22:26:40,694 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-15 22:26:40,702 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-15 22:26:40,877 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-15 22:26:40,885 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-15 22:26:40,975 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:26:40,975 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-15 22:26:40,986 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-15 22:26:41,069 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)|) (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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 0) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (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|) (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|))) (= |c_#valid| |c_old(#valid)|) (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-15 22:26:41,077 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)|) (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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 0) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (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|) (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|))) (= |c_#valid| |c_old(#valid)|) (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-15 22:26:41,248 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)|) (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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 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_arrayElimCell_267)) (= (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|) (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|))) (= 0 |c_node_create_~temp~0#1.offset|) (< |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-15 22:26:41,256 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)|) (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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 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_arrayElimCell_267)) (= (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|) (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|))) (= 0 |c_node_create_~temp~0#1.offset|) (< |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-15 22:26:41,583 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|)) (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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 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_arrayElimCell_267)) (= (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|) (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|))) (= 0 |c_node_create_~temp~0#1.offset|) (< |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-15 22:26:41,592 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|)) (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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 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_arrayElimCell_267)) (= (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|) (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|))) (= 0 |c_node_create_~temp~0#1.offset|) (< |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-15 22:26:41,606 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-15 22:26:41,786 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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 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_arrayElimCell_267)) (= (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|) (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|))) (= 0 |c_node_create_~temp~0#1.offset|) (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-15 22:26:41,795 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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 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_arrayElimCell_267)) (= (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|) (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|))) (= 0 |c_node_create_~temp~0#1.offset|) (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-15 22:26:41,825 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-15 22:26:41,983 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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 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_arrayElimCell_267)) (= (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|) (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|))) (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-15 22:26:41,992 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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 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_arrayElimCell_267)) (= (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|) (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|))) (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-15 22:26:42,178 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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 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_arrayElimCell_267)) (= (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|) (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|))) (= 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-15 22:26:42,187 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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 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_arrayElimCell_267)) (= (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|) (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|))) (= 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-15 22:26:42,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:42,410 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-15 22:26:42,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:42,497 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:26:42,497 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-15 22:26:42,842 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|) (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (= (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_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-15 22:26:42,852 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|) (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (= (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_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-15 22:26:43,258 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_~new_last~0#1.base| 2)) (.cse4 (+ .cse5 2)) (.cse6 (select .cse8 0))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (= (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| .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) (<= .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-15 22:26:43,268 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_~new_last~0#1.base| 2)) (.cse4 (+ .cse5 2)) (.cse6 (select .cse8 0))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (= (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| .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) (<= .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-15 22:26:43,697 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_~new_last~0#1.base| 2)) (.cse4 (+ .cse5 2)) (.cse6 (select .cse8 0))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (= (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| .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) (<= .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-15 22:26:43,707 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_~new_last~0#1.base| 2)) (.cse4 (+ .cse5 2)) (.cse6 (select .cse8 0))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (= (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| .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) (<= .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-15 22:26:44,481 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_~new_last~0#1.base| 2)) (.cse4 (+ .cse5 2)) (.cse6 (select .cse8 0))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (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| .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))) (= |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 .cse8 4) .cse6) (= 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) (= |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-15 22:26:44,490 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_~new_last~0#1.base| 2)) (.cse4 (+ .cse5 2)) (.cse6 (select .cse8 0))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (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| .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))) (= |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 .cse8 4) .cse6) (= 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) (= |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-15 22:26:44,830 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_~new_last~0#1.base| 2)) (.cse4 (+ .cse5 2)) (.cse6 (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))) (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (= (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| .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) (<= .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-15 22:26:44,840 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_~new_last~0#1.base| 2)) (.cse4 (+ .cse5 2)) (.cse6 (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))) (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (= (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| .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) (<= .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-15 22:26:45,197 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_~new_last~0#1.base| 2)) (.cse4 (+ .cse5 2)) (.cse6 (select .cse8 0))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (= (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| .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) (<= .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|) (= |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) .cse6))))) is different from false [2023-02-15 22:26:45,207 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_~new_last~0#1.base| 2)) (.cse4 (+ .cse5 2)) (.cse6 (select .cse8 0))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (= (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| .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) (<= .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|) (= |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) .cse6))))) is different from true [2023-02-15 22:26:45,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:45,398 INFO L321 Elim1Store]: treesize reduction 98, result has 16.2 percent of original size [2023-02-15 22:26:45,399 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-15 22:26:45,699 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:26:45,699 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-15 22:26:45,709 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-15 22:26:45,807 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 ((.cse9 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse6 2)) (.cse5 (select .cse9 4)) (.cse7 (select .cse9 0))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (= (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| .cse5)) (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))) (<= .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|) (= .cse5 .cse7))))) is different from false [2023-02-15 22:26:45,817 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 ((.cse9 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse6 2)) (.cse5 (select .cse9 4)) (.cse7 (select .cse9 0))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (= (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| .cse5)) (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))) (<= .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|) (= .cse5 .cse7))))) is different from true [2023-02-15 22:26:45,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:45,914 INFO L321 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2023-02-15 22:26:45,915 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-15 22:26:45,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:45,931 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-15 22:26:46,290 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 ((.cse9 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse6 2)) (.cse5 (select .cse9 4)) (.cse7 (select .cse9 0))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (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| .cse5)) (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))) (<= .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|) (= .cse5 .cse7))))) is different from false [2023-02-15 22:26:46,299 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 ((.cse9 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse6 2)) (.cse5 (select .cse9 4)) (.cse7 (select .cse9 0))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (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| .cse5)) (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))) (<= .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|) (= .cse5 .cse7))))) is different from true [2023-02-15 22:26:46,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:46,722 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:26:46,722 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-15 22:26:46,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:46,792 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-15 22:26:47,136 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 ((.cse9 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse6 2)) (.cse5 (select .cse9 4)) (.cse7 (select .cse9 0))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (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| .cse5)) (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))) (<= .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|) (= .cse5 .cse7))))) is different from false [2023-02-15 22:26:47,146 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 ((.cse9 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse6 2)) (.cse5 (select .cse9 4)) (.cse7 (select .cse9 0))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (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| .cse5)) (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))) (<= .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|) (= .cse5 .cse7))))) is different from true [2023-02-15 22:26:47,830 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 ((.cse9 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse6 2)) (.cse5 (select .cse9 4)) (.cse7 (select .cse9 0))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (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| .cse5)) (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))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse6) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 .cse7))))) is different from false [2023-02-15 22:26:47,840 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 ((.cse9 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse6 2)) (.cse5 (select .cse9 4)) (.cse7 (select .cse9 0))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (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| .cse5)) (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))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse6) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 .cse7))))) is different from true [2023-02-15 22:26:48,057 INFO L321 Elim1Store]: treesize reduction 62, result has 34.0 percent of original size [2023-02-15 22:26:48,062 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-15 22:26:48,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:26:48,092 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-15 22:26:57,079 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 ((.cse7 (+ .cse0 2))) (and (let ((.cse20 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse20 4)) (.cse1 (select .cse20 0))) (or (let ((.cse8 (+ .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| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse2)) (= (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| .cse1) 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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |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) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (+ .cse1 2))) (and (<= .cse9 |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_arrayElimCell_268 Int)) (let ((.cse10 (+ v_arrayElimCell_267 2))) (and (<= .cse10 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (<= .cse9 |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 (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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 ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse13 (select |v_#valid_BEFORE_CALL_48| .cse13))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse1)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_268 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))) (let ((.cse18 (select .cse20 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimCell_267 2)) (.cse14 (+ .cse18 2))) (and (<= .cse14 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse15 |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_arrayElimCell_268) 0) (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse16 (select |v_#valid_BEFORE_CALL_44| .cse16))) |v_#valid_BEFORE_CALL_44|) (<= .cse14 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse17 (select |v_#valid_BEFORE_CALL_45| .cse17))) |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|)) (<= .cse15 |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) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse18)) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 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) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse19 (select |v_#valid_BEFORE_CALL_48| .cse19))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse1))))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 22:26:57,090 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 ((.cse7 (+ .cse0 2))) (and (let ((.cse20 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse20 4)) (.cse1 (select .cse20 0))) (or (let ((.cse8 (+ .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| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse2)) (= (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| .cse1) 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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |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) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (+ .cse1 2))) (and (<= .cse9 |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_arrayElimCell_268 Int)) (let ((.cse10 (+ v_arrayElimCell_267 2))) (and (<= .cse10 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (<= .cse9 |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 (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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 ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse13 (select |v_#valid_BEFORE_CALL_48| .cse13))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse1)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_268 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))) (let ((.cse18 (select .cse20 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimCell_267 2)) (.cse14 (+ .cse18 2))) (and (<= .cse14 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse15 |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_arrayElimCell_268) 0) (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse16 (select |v_#valid_BEFORE_CALL_44| .cse16))) |v_#valid_BEFORE_CALL_44|) (<= .cse14 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse17 (select |v_#valid_BEFORE_CALL_45| .cse17))) |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|)) (<= .cse15 |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) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse18)) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 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) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse19 (select |v_#valid_BEFORE_CALL_48| .cse19))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse1))))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-15 22:26:58,879 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-15 22:27:01,719 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 ((.cse7 (+ .cse0 2))) (and (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0) (let ((.cse20 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse20 4)) (.cse1 (select .cse20 0))) (or (let ((.cse8 (+ .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| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse2)) (= (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| .cse1) 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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |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) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (+ .cse1 2))) (and (<= .cse9 |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_arrayElimCell_268 Int)) (let ((.cse10 (+ v_arrayElimCell_267 2))) (and (<= .cse10 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (<= .cse9 |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 (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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 ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse13 (select |v_#valid_BEFORE_CALL_48| .cse13))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse1)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_268 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))) (let ((.cse18 (select .cse20 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimCell_267 2)) (.cse14 (+ .cse18 2))) (and (<= .cse14 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse15 |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_arrayElimCell_268) 0) (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse16 (select |v_#valid_BEFORE_CALL_44| .cse16))) |v_#valid_BEFORE_CALL_44|) (<= .cse14 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse17 (select |v_#valid_BEFORE_CALL_45| .cse17))) |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|)) (<= .cse15 |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) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse18)) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 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) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse19 (select |v_#valid_BEFORE_CALL_48| .cse19))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse1))))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse0) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 22:27:01,730 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 ((.cse7 (+ .cse0 2))) (and (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0) (let ((.cse20 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse20 4)) (.cse1 (select .cse20 0))) (or (let ((.cse8 (+ .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| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse2)) (= (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| .cse1) 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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |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) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (+ .cse1 2))) (and (<= .cse9 |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_arrayElimCell_268 Int)) (let ((.cse10 (+ v_arrayElimCell_267 2))) (and (<= .cse10 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (<= .cse9 |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 (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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 ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse13 (select |v_#valid_BEFORE_CALL_48| .cse13))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse1)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_268 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))) (let ((.cse18 (select .cse20 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimCell_267 2)) (.cse14 (+ .cse18 2))) (and (<= .cse14 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse15 |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_arrayElimCell_268) 0) (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse16 (select |v_#valid_BEFORE_CALL_44| .cse16))) |v_#valid_BEFORE_CALL_44|) (<= .cse14 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse17 (select |v_#valid_BEFORE_CALL_45| .cse17))) |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|)) (<= .cse15 |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) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse18)) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 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) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse19 (select |v_#valid_BEFORE_CALL_48| .cse19))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse1))))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse0) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-15 22:27:04,773 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 ((.cse7 (+ .cse0 2))) (and (let ((.cse20 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse20 4)) (.cse1 (select .cse20 0))) (or (let ((.cse8 (+ .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| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse2)) (= (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| .cse1) 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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |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) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (+ .cse1 2))) (and (<= .cse9 |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_arrayElimCell_268 Int)) (let ((.cse10 (+ v_arrayElimCell_267 2))) (and (<= .cse10 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (<= .cse9 |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 (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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 ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse13 (select |v_#valid_BEFORE_CALL_48| .cse13))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse1)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_268 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))) (let ((.cse18 (select .cse20 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimCell_267 2)) (.cse14 (+ .cse18 2))) (and (<= .cse14 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse15 |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_arrayElimCell_268) 0) (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse16 (select |v_#valid_BEFORE_CALL_44| .cse16))) |v_#valid_BEFORE_CALL_44|) (<= .cse14 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse17 (select |v_#valid_BEFORE_CALL_45| .cse17))) |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|)) (<= .cse15 |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) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse18)) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 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) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse19 (select |v_#valid_BEFORE_CALL_48| .cse19))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse1))))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 22:27:04,784 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 ((.cse7 (+ .cse0 2))) (and (let ((.cse20 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse20 4)) (.cse1 (select .cse20 0))) (or (let ((.cse8 (+ .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| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse2)) (= (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| .cse1) 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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |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) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (+ .cse1 2))) (and (<= .cse9 |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_arrayElimCell_268 Int)) (let ((.cse10 (+ v_arrayElimCell_267 2))) (and (<= .cse10 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (<= .cse9 |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 (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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 ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse13 (select |v_#valid_BEFORE_CALL_48| .cse13))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse1)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_268 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))) (let ((.cse18 (select .cse20 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimCell_267 2)) (.cse14 (+ .cse18 2))) (and (<= .cse14 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse15 |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_arrayElimCell_268) 0) (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse16 (select |v_#valid_BEFORE_CALL_44| .cse16))) |v_#valid_BEFORE_CALL_44|) (<= .cse14 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse17 (select |v_#valid_BEFORE_CALL_45| .cse17))) |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|)) (<= .cse15 |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) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse18)) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 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) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse19 (select |v_#valid_BEFORE_CALL_48| .cse19))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse1))))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-15 22:27:09,385 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 ((.cse20 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (select .cse20 0)) (.cse7 (+ .cse1 2))) (and (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse0) (let ((.cse2 (select .cse20 4))) (or (let ((.cse8 (+ .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| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse0) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) .cse2)) (= (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| .cse0) 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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |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) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (+ .cse0 2))) (and (<= .cse9 |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_arrayElimCell_268 Int)) (let ((.cse10 (+ v_arrayElimCell_267 2))) (and (<= .cse10 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (<= .cse9 |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 (= (select |v_#valid_BEFORE_CALL_48| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse13 (select |v_#valid_BEFORE_CALL_48| .cse13))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) .cse0)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_268 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))) (let ((.cse18 (select .cse20 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimCell_267 2)) (.cse14 (+ .cse18 2))) (and (<= .cse14 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse15 |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_arrayElimCell_268) 0) (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse16 (select |v_#valid_BEFORE_CALL_44| .cse16))) |v_#valid_BEFORE_CALL_44|) (<= .cse14 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse17 (select |v_#valid_BEFORE_CALL_45| .cse17))) |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|)) (<= .cse15 |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) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse1)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) .cse18)) (= (select |v_#valid_BEFORE_CALL_48| .cse0) 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) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse19 (select |v_#valid_BEFORE_CALL_48| .cse19))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse0) 0) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse0)))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 22:27:09,396 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 ((.cse20 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (select .cse20 0)) (.cse7 (+ .cse1 2))) (and (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse0) (let ((.cse2 (select .cse20 4))) (or (let ((.cse8 (+ .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| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse0) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) .cse2)) (= (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| .cse0) 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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |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) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (+ .cse0 2))) (and (<= .cse9 |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_arrayElimCell_268 Int)) (let ((.cse10 (+ v_arrayElimCell_267 2))) (and (<= .cse10 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (<= .cse9 |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 (= (select |v_#valid_BEFORE_CALL_48| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse13 (select |v_#valid_BEFORE_CALL_48| .cse13))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) .cse0)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_268 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))) (let ((.cse18 (select .cse20 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimCell_267 2)) (.cse14 (+ .cse18 2))) (and (<= .cse14 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse15 |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_arrayElimCell_268) 0) (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse16 (select |v_#valid_BEFORE_CALL_44| .cse16))) |v_#valid_BEFORE_CALL_44|) (<= .cse14 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse17 (select |v_#valid_BEFORE_CALL_45| .cse17))) |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|)) (<= .cse15 |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) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse1)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) .cse18)) (= (select |v_#valid_BEFORE_CALL_48| .cse0) 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) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse19 (select |v_#valid_BEFORE_CALL_48| .cse19))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse0) 0) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse0)))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from true [2023-02-15 22:27:12,178 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 ((.cse20 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse1 (select .cse20 0)) (.cse7 (+ .cse0 2))) (and (let ((.cse2 (select .cse20 4))) (or (let ((.cse8 (+ .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| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse2)) (= (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| .cse1) 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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |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) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (+ .cse1 2))) (and (<= .cse9 |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_arrayElimCell_268 Int)) (let ((.cse10 (+ v_arrayElimCell_267 2))) (and (<= .cse10 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (<= .cse9 |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 (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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 ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse13 (select |v_#valid_BEFORE_CALL_48| .cse13))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse1)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_268 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))) (let ((.cse18 (select .cse20 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimCell_267 2)) (.cse14 (+ .cse18 2))) (and (<= .cse14 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse15 |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_arrayElimCell_268) 0) (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse16 (select |v_#valid_BEFORE_CALL_44| .cse16))) |v_#valid_BEFORE_CALL_44|) (<= .cse14 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse17 (select |v_#valid_BEFORE_CALL_45| .cse17))) |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|)) (<= .cse15 |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) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse18)) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 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) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse19 (select |v_#valid_BEFORE_CALL_48| .cse19))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse1)))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 22:27:12,196 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 ((.cse20 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse1 (select .cse20 0)) (.cse7 (+ .cse0 2))) (and (let ((.cse2 (select .cse20 4))) (or (let ((.cse8 (+ .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| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse2)) (= (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| .cse1) 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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |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) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (+ .cse1 2))) (and (<= .cse9 |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_arrayElimCell_268 Int)) (let ((.cse10 (+ v_arrayElimCell_267 2))) (and (<= .cse10 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (<= .cse9 |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 (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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 ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse13 (select |v_#valid_BEFORE_CALL_48| .cse13))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse1)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_268 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))) (let ((.cse18 (select .cse20 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimCell_267 2)) (.cse14 (+ .cse18 2))) (and (<= .cse14 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse15 |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_arrayElimCell_268) 0) (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse16 (select |v_#valid_BEFORE_CALL_44| .cse16))) |v_#valid_BEFORE_CALL_44|) (<= .cse14 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse17 (select |v_#valid_BEFORE_CALL_45| .cse17))) |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|)) (<= .cse15 |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) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse18)) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 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) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse19 (select |v_#valid_BEFORE_CALL_48| .cse19))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse1)))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from true [2023-02-15 22:27:12,454 INFO L321 Elim1Store]: treesize reduction 22, result has 46.3 percent of original size [2023-02-15 22:27:12,454 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 692 treesize of output 481 [2023-02-15 22:27:16,663 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)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_arrayElimCell_293 Int) (|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_54| v_arrayElimCell_293) 0) (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_293) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse0 (select |v_#valid_BEFORE_CALL_48| .cse0))) |v_#valid_BEFORE_CALL_48|) (= (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|)))) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |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_arrayElimCell_268 Int)) (let ((.cse3 (+ v_arrayElimCell_267 2))) (and (<= .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_arrayElimCell_268) 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|) (= (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|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse5 (select |v_#valid_BEFORE_CALL_45| .cse5))) |v_#valid_BEFORE_CALL_45|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (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|)) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_268) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|))))))) (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (exists ((v_prenex_121 (Array Int Int)) (v_prenex_123 (Array Int Int)) (v_prenex_124 (Array Int Int)) (v_prenex_126 (Array Int Int)) (v_prenex_127 Int) (v_prenex_129 (Array Int Int)) (v_prenex_128 Int) (v_prenex_119 (Array Int Int)) (v_prenex_125 Int) (v_arrayElimCell_295 Int) (v_prenex_122 Int) (v_prenex_120 Int)) (let ((.cse7 (+ v_prenex_127 2)) (.cse6 (+ v_arrayElimCell_295 2))) (and (= (select v_prenex_123 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (<= .cse6 v_prenex_125) (= (select v_prenex_121 v_prenex_120) 1) (= (select v_prenex_121 v_prenex_122) 0) (= (select v_prenex_126 v_prenex_122) 1) (<= .cse7 v_prenex_125) (not (= 0 v_prenex_120)) (= 0 (select v_prenex_129 |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (select v_prenex_129 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= .cse7 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse7 v_prenex_120) (= (select v_prenex_123 |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse8 (@diff v_prenex_121 v_prenex_126))) (store v_prenex_121 .cse8 (select v_prenex_126 .cse8))) v_prenex_126) (<= .cse6 v_prenex_120) (= 0 (select (store v_prenex_129 |c_ULTIMATE.start_main_#t~mem17#1.base| 1) v_arrayElimCell_295)) (<= .cse2 v_prenex_125) (<= .cse6 |ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 v_prenex_125)) (= (let ((.cse9 (@diff v_prenex_123 v_prenex_129))) (store v_prenex_123 .cse9 (select v_prenex_129 .cse9))) v_prenex_129) (<= .cse2 v_prenex_120) (= (select v_prenex_124 v_prenex_128) 1) (= (let ((.cse10 (@diff v_prenex_119 v_prenex_124))) (store v_prenex_119 .cse10 (select v_prenex_124 .cse10))) v_prenex_124) (= (select v_prenex_119 v_prenex_128) 0) (= 0 (select v_prenex_124 v_prenex_127)) (= (select v_prenex_119 v_prenex_125) 1)))) (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (<= .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|)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_293 Int)) (let ((.cse12 (+ v_arrayElimCell_293 2))) (and (exists ((v_prenex_116 Int) (v_prenex_108 (Array Int Int)) (v_prenex_117 Int) (v_prenex_114 Int) (v_prenex_111 Int) (v_prenex_110 (Array Int Int)) (v_prenex_113 (Array Int Int)) (v_prenex_109 Int) (v_prenex_115 (Array Int Int))) (let ((.cse13 (+ v_prenex_116 2))) (and (= (let ((.cse11 (@diff v_prenex_108 v_prenex_113))) (store v_prenex_108 .cse11 (select v_prenex_113 .cse11))) v_prenex_113) (= (select v_prenex_115 v_prenex_111) 1) (<= .cse12 v_prenex_109) (not (= 0 v_prenex_114)) (= (select v_prenex_113 v_prenex_117) 1) (<= .cse12 v_prenex_114) (<= .cse2 v_prenex_114) (= (select v_prenex_110 v_prenex_109) 1) (= (select v_prenex_108 v_prenex_117) 0) (<= .cse2 v_prenex_109) (<= .cse13 v_prenex_114) (= (select v_prenex_110 v_prenex_111) 0) (<= .cse13 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse13 v_prenex_109) (= (select v_prenex_108 v_prenex_114) 1) (= 0 (select v_prenex_113 v_prenex_116)) (= (let ((.cse14 (@diff v_prenex_110 v_prenex_115))) (store v_prenex_110 .cse14 (select v_prenex_115 .cse14))) v_prenex_115) (not (= 0 v_prenex_109))))) (exists ((v_prenex_118 (Array Int Int)) (v_prenex_112 (Array Int Int))) (and (= (select v_prenex_118 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= 0 (select (store v_prenex_118 |c_ULTIMATE.start_main_#t~mem17#1.base| 1) v_arrayElimCell_293)) (= (select v_prenex_112 |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse15 (@diff v_prenex_112 v_prenex_118))) (store v_prenex_112 .cse15 (select v_prenex_118 .cse15))) v_prenex_118) (= 0 (select v_prenex_118 |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (select v_prenex_112 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (<= .cse12 |ULTIMATE.start_main_~#s~0#1.base|)))))))) is different from false [2023-02-15 22:27:16,680 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)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_arrayElimCell_293 Int) (|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_54| v_arrayElimCell_293) 0) (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_293) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse0 (select |v_#valid_BEFORE_CALL_48| .cse0))) |v_#valid_BEFORE_CALL_48|) (= (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|)))) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |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_arrayElimCell_268 Int)) (let ((.cse3 (+ v_arrayElimCell_267 2))) (and (<= .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_arrayElimCell_268) 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|) (= (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|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse5 (select |v_#valid_BEFORE_CALL_45| .cse5))) |v_#valid_BEFORE_CALL_45|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (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|)) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_268) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|))))))) (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (exists ((v_prenex_121 (Array Int Int)) (v_prenex_123 (Array Int Int)) (v_prenex_124 (Array Int Int)) (v_prenex_126 (Array Int Int)) (v_prenex_127 Int) (v_prenex_129 (Array Int Int)) (v_prenex_128 Int) (v_prenex_119 (Array Int Int)) (v_prenex_125 Int) (v_arrayElimCell_295 Int) (v_prenex_122 Int) (v_prenex_120 Int)) (let ((.cse7 (+ v_prenex_127 2)) (.cse6 (+ v_arrayElimCell_295 2))) (and (= (select v_prenex_123 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (<= .cse6 v_prenex_125) (= (select v_prenex_121 v_prenex_120) 1) (= (select v_prenex_121 v_prenex_122) 0) (= (select v_prenex_126 v_prenex_122) 1) (<= .cse7 v_prenex_125) (not (= 0 v_prenex_120)) (= 0 (select v_prenex_129 |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (select v_prenex_129 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= .cse7 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse7 v_prenex_120) (= (select v_prenex_123 |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse8 (@diff v_prenex_121 v_prenex_126))) (store v_prenex_121 .cse8 (select v_prenex_126 .cse8))) v_prenex_126) (<= .cse6 v_prenex_120) (= 0 (select (store v_prenex_129 |c_ULTIMATE.start_main_#t~mem17#1.base| 1) v_arrayElimCell_295)) (<= .cse2 v_prenex_125) (<= .cse6 |ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 v_prenex_125)) (= (let ((.cse9 (@diff v_prenex_123 v_prenex_129))) (store v_prenex_123 .cse9 (select v_prenex_129 .cse9))) v_prenex_129) (<= .cse2 v_prenex_120) (= (select v_prenex_124 v_prenex_128) 1) (= (let ((.cse10 (@diff v_prenex_119 v_prenex_124))) (store v_prenex_119 .cse10 (select v_prenex_124 .cse10))) v_prenex_124) (= (select v_prenex_119 v_prenex_128) 0) (= 0 (select v_prenex_124 v_prenex_127)) (= (select v_prenex_119 v_prenex_125) 1)))) (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (<= .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|)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_293 Int)) (let ((.cse12 (+ v_arrayElimCell_293 2))) (and (exists ((v_prenex_116 Int) (v_prenex_108 (Array Int Int)) (v_prenex_117 Int) (v_prenex_114 Int) (v_prenex_111 Int) (v_prenex_110 (Array Int Int)) (v_prenex_113 (Array Int Int)) (v_prenex_109 Int) (v_prenex_115 (Array Int Int))) (let ((.cse13 (+ v_prenex_116 2))) (and (= (let ((.cse11 (@diff v_prenex_108 v_prenex_113))) (store v_prenex_108 .cse11 (select v_prenex_113 .cse11))) v_prenex_113) (= (select v_prenex_115 v_prenex_111) 1) (<= .cse12 v_prenex_109) (not (= 0 v_prenex_114)) (= (select v_prenex_113 v_prenex_117) 1) (<= .cse12 v_prenex_114) (<= .cse2 v_prenex_114) (= (select v_prenex_110 v_prenex_109) 1) (= (select v_prenex_108 v_prenex_117) 0) (<= .cse2 v_prenex_109) (<= .cse13 v_prenex_114) (= (select v_prenex_110 v_prenex_111) 0) (<= .cse13 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse13 v_prenex_109) (= (select v_prenex_108 v_prenex_114) 1) (= 0 (select v_prenex_113 v_prenex_116)) (= (let ((.cse14 (@diff v_prenex_110 v_prenex_115))) (store v_prenex_110 .cse14 (select v_prenex_115 .cse14))) v_prenex_115) (not (= 0 v_prenex_109))))) (exists ((v_prenex_118 (Array Int Int)) (v_prenex_112 (Array Int Int))) (and (= (select v_prenex_118 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= 0 (select (store v_prenex_118 |c_ULTIMATE.start_main_#t~mem17#1.base| 1) v_arrayElimCell_293)) (= (select v_prenex_112 |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse15 (@diff v_prenex_112 v_prenex_118))) (store v_prenex_112 .cse15 (select v_prenex_118 .cse15))) v_prenex_118) (= 0 (select v_prenex_118 |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (select v_prenex_112 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (<= .cse12 |ULTIMATE.start_main_~#s~0#1.base|)))))))) is different from true [2023-02-15 22:27:16,685 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-15 22:27:16,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:27:20,055 WARN L837 $PredicateComparison]: unable to prove that (forall ((|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 |c_#memory_$Pointer$.base| |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 |c_#memory_$Pointer$.offset| |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-15 22:27:20,095 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-15 22:27:20,116 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-15 22:27:20,145 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-15 22:27:20,168 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-15 22:27:20,229 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-15 22:27:20,571 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:27:20,572 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-15 22:27:20,625 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-15 22:27:20,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642642342] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:20,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:27:20,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 42] total 78 [2023-02-15 22:27:20,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332221786] [2023-02-15 22:27:20,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:27:20,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2023-02-15 22:27:20,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:27:20,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2023-02-15 22:27:20,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1751, Unknown=103, NotChecked=5418, Total=7482 [2023-02-15 22:27:20,632 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-15 22:27:22,384 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-15 22:27:22,392 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-15 22:27:22,401 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-15 22:27:22,408 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-15 22:27:22,417 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-15 22:27:22,425 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-15 22:27:22,434 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-15 22:27:22,441 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-15 22:27:22,451 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-15 22:27:22,458 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-15 22:27:22,475 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-15 22:27:22,487 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-15 22:27:22,503 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-15 22:27:22,512 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-15 22:27:22,530 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-15 22:27:22,538 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-15 22:27:22,552 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-15 22:27:22,561 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-15 22:27:22,575 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-15 22:27:22,583 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-15 22:27:22,598 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 (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (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-15 22:27:22,607 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 (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (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-15 22:27:22,622 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 (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (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-15 22:27:22,630 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 (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (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-15 22:27:22,674 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 (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (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-15 22:27:22,683 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 (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (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-15 22:27:22,696 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-15 22:27:22,705 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-15 22:27:22,718 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_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) (= |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)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) (not (= .cse3 .cse0)))))) is different from false [2023-02-15 22:27:22,726 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_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) (= |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)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) (not (= .cse3 .cse0)))))) is different from true [2023-02-15 22:27:22,743 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)|) (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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 0) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (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|) (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|))) (= |c_#valid| |c_old(#valid)|) (= |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-15 22:27:22,752 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)|) (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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 0) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (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|) (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|))) (= |c_#valid| |c_old(#valid)|) (= |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-15 22:27:22,771 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)|) (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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 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_arrayElimCell_267)) (= (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|) (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|))) (= .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|) (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-15 22:27:22,779 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)|) (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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 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_arrayElimCell_267)) (= (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|) (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|))) (= .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|) (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-15 22:27:22,803 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|) (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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 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_arrayElimCell_267)) (= (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|) (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|))) (= 0 |c_node_create_~temp~0#1.offset|) (= .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-15 22:27:22,811 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|) (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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 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_arrayElimCell_267)) (= (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|) (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|))) (= 0 |c_node_create_~temp~0#1.offset|) (= .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-15 22:27:22,834 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|) (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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 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_arrayElimCell_267)) (= (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|) (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|))) (= 0 |c_node_create_~temp~0#1.offset|) (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-15 22:27:22,842 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|) (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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 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_arrayElimCell_267)) (= (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|) (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|))) (= 0 |c_node_create_~temp~0#1.offset|) (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-15 22:27:22,866 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|) (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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 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_arrayElimCell_267)) (= (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|) (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|))) (= 0 |c_node_create_~temp~0#1.offset|) (= .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-15 22:27:22,874 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|) (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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 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_arrayElimCell_267)) (= (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|) (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|))) (= 0 |c_node_create_~temp~0#1.offset|) (= .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-15 22:27:23,009 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|) (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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 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_arrayElimCell_267)) (= (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|) (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 (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) 0) 0) (= 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-15 22:27:23,022 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|) (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_arrayElimCell_268 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (< v_arrayElimCell_267 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_50| v_arrayElimCell_268) 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_arrayElimCell_267)) (= (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|) (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 (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|) 0) 0) (= 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-15 22:27:23,070 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 ((.cse1 (select .cse5 0)) (.cse6 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse3 (+ .cse0 2)) (.cse4 (= |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|)) (= |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_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| .cse1) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse2 (select |v_#valid_BEFORE_CALL_48| .cse2))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 1))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse4 (= (select .cse5 4) .cse1) (= 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) (<= .cse6 |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_arrayElimCell_268 Int)) (let ((.cse7 (+ v_arrayElimCell_267 2))) (and (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .cse7 |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) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (let ((.cse10 (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 (let ((.cse12 (select |c_#memory_$Pointer$.base| .cse10))) (let ((.cse11 (select .cse12 4))) (and (not (= .cse10 |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| .cse11)) (not (= .cse11 .cse10)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse10)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) (= (select .cse12 0) .cse11) .cse4))) (= .cse10 0))))))) is different from false [2023-02-15 22:27:23,080 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 ((.cse1 (select .cse5 0)) (.cse6 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse3 (+ .cse0 2)) (.cse4 (= |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|)) (= |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_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| .cse1) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse2 (select |v_#valid_BEFORE_CALL_48| .cse2))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 1))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse4 (= (select .cse5 4) .cse1) (= 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) (<= .cse6 |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_arrayElimCell_268 Int)) (let ((.cse7 (+ v_arrayElimCell_267 2))) (and (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .cse7 |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) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (let ((.cse10 (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 (let ((.cse12 (select |c_#memory_$Pointer$.base| .cse10))) (let ((.cse11 (select .cse12 4))) (and (not (= .cse10 |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| .cse11)) (not (= .cse11 .cse10)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse10)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) (= (select .cse12 0) .cse11) .cse4))) (= .cse10 0))))))) is different from true [2023-02-15 22:27:23,142 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 ((.cse12 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse5 2)) (.cse11 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select .cse12 0))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (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| .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) (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|)) (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)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) (= (select .cse10 0) .cse9) .cse11))))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse11 (= (select .cse12 4) .cse6) (= 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))))) is different from false [2023-02-15 22:27:23,152 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 ((.cse12 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse5 2)) (.cse11 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select .cse12 0))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (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| .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) (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|)) (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)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) (= (select .cse10 0) .cse9) .cse11))))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse11 (= (select .cse12 4) .cse6) (= 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))))) is different from true [2023-02-15 22:27:23,212 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (select |c_#memory_$Pointer$.base| .cse9))) (let ((.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse8 (+ .cse9 2)) (.cse3 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse10 (select .cse12 0))) (and (or (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|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (select .cse2 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|)) (not (= .cse1 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= .cse0 .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) (= (select .cse2 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|)) .cse3)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.base| 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_arrayElimCell_268 Int)) (let ((.cse5 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.offset| 0) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse4 |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| .cse9)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse10) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse9 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse11 (select |v_#valid_BEFORE_CALL_48| .cse11))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse10) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse3 (= (select .cse12 4) .cse10) (= 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))))) is different from false [2023-02-15 22:27:23,223 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (select |c_#memory_$Pointer$.base| .cse9))) (let ((.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse8 (+ .cse9 2)) (.cse3 (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse10 (select .cse12 0))) (and (or (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|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (select .cse2 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|)) (not (= .cse1 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (not (= .cse0 .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) (= (select .cse2 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|)) .cse3)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.base| 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_arrayElimCell_268 Int)) (let ((.cse5 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem10#1.offset| 0) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse4 |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| .cse9)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse10) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse9 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse11 (select |v_#valid_BEFORE_CALL_48| .cse11))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse10) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse3 (= (select .cse12 4) .cse10) (= 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))))) is different from true [2023-02-15 22:27:23,296 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.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|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse8)) (.cse12 (select |c_#memory_$Pointer$.base| .cse9))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse9 2)) (.cse10 (select .cse12 0)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (select .cse5 4))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (= (select .cse5 .cse6) .cse7) (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|) (not (= .cse8 |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| .cse9)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse10) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse9 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse11 (select |v_#valid_BEFORE_CALL_48| .cse11))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse10) 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| .cse8)) (<= .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 .cse12 4) .cse10) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse7)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (= .cse6 0) (not (= .cse7 .cse8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))))) is different from false [2023-02-15 22:27:23,306 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.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|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse8)) (.cse12 (select |c_#memory_$Pointer$.base| .cse9))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse9 2)) (.cse10 (select .cse12 0)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (select .cse5 4))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (= (select .cse5 .cse6) .cse7) (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|) (not (= .cse8 |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| .cse9)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse10) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse9 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse11 (select |v_#valid_BEFORE_CALL_48| .cse11))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse10) 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| .cse8)) (<= .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 .cse12 4) .cse10) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse7)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (= .cse6 0) (not (= .cse7 .cse8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))))) is different from true [2023-02-15 22:27:23,380 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 ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|)) (.cse11 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse5 2)) (.cse6 (select .cse11 0)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (select .cse12 (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (.cse9 (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 (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset|) (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| .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))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| .cse8) (= (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| .cse9)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse10)) (<= .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 .cse11 4) .cse6) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse10 |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) (= .cse8 0) (= (select .cse12 .cse8) .cse10) (= .cse9 |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse9))))) is different from false [2023-02-15 22:27:23,390 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 ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|)) (.cse11 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse5 2)) (.cse6 (select .cse11 0)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (select .cse12 (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (.cse9 (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 (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset|) (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| .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))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| .cse8) (= (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| .cse9)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse10)) (<= .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 .cse11 4) .cse6) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse10 |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) (= .cse8 0) (= (select .cse12 .cse8) .cse10) (= .cse9 |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse9))))) is different from true [2023-02-15 22:27:23,444 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse11 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (+ .cse7 2)) (.cse8 (select .cse11 0)) (.cse0 (select |c_#memory_$Pointer$.base| .cse10)) (.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|))) (and (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select .cse0 (+ .cse1 4))) (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_arrayElimCell_268 Int)) (let ((.cse3 (+ v_arrayElimCell_267 2))) (and (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .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_arrayElimCell_268) 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|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse5 (select |v_#valid_BEFORE_CALL_45| .cse5))) |v_#valid_BEFORE_CALL_45|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse3 |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) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (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| .cse7)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse8) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse7 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse9 (select |v_#valid_BEFORE_CALL_48| .cse9))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse8) 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| .cse10)) (<= .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|) (= (select .cse11 4) .cse8) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10)) (= (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|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) (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| .cse10)))))) is different from false [2023-02-15 22:27:23,454 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse11 (select |c_#memory_$Pointer$.base| .cse7))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (+ .cse7 2)) (.cse8 (select .cse11 0)) (.cse0 (select |c_#memory_$Pointer$.base| .cse10)) (.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|))) (and (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select .cse0 (+ .cse1 4))) (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_arrayElimCell_268 Int)) (let ((.cse3 (+ v_arrayElimCell_267 2))) (and (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .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_arrayElimCell_268) 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|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse5 (select |v_#valid_BEFORE_CALL_45| .cse5))) |v_#valid_BEFORE_CALL_45|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse3 |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) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (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| .cse7)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse8) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse7 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse9 (select |v_#valid_BEFORE_CALL_48| .cse9))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse8) 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| .cse10)) (<= .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|) (= (select .cse11 4) .cse8) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10)) (= (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|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) (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| .cse10)))))) is different from true [2023-02-15 22:27:23,517 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (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|)) (.cse11 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse7 (+ .cse8 2)) (.cse9 (select .cse11 0)) (.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))) (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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |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_arrayElimCell_268) 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|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (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| .cse8)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse9) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#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| .cse9) 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 .cse11 4) .cse9) (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) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select .cse1 (+ .cse2 4))))))) is different from false [2023-02-15 22:27:23,526 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (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|)) (.cse11 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse7 (+ .cse8 2)) (.cse9 (select .cse11 0)) (.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))) (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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |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_arrayElimCell_268) 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|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (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| .cse8)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse9) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#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| .cse9) 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 .cse11 4) .cse9) (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) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select .cse1 (+ .cse2 4))))))) is different from true [2023-02-15 22:27:23,594 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 ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse12 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse6 2)) (.cse5 (select .cse12 4)) (.cse7 (select .cse12 0)) (.cse9 (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (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| .cse5)) (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))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse9)) (<= .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|) (= .cse5 .cse7) (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| .cse9)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (= (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse9) (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))))) is different from false [2023-02-15 22:27:23,604 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 ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse12 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse6 2)) (.cse5 (select .cse12 4)) (.cse7 (select .cse12 0)) (.cse9 (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (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| .cse5)) (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))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse9)) (<= .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|) (= .cse5 .cse7) (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| .cse9)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4) 0) (= (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse9) (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))))) is different from true [2023-02-15 22:27:23,664 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 ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse12 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse6 2)) (.cse5 (select .cse12 4)) (.cse7 (select .cse12 0)) (.cse9 (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (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| .cse5)) (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))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse9)) (<= .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|) (= .cse5 .cse7) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse9)) (= (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse9) (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))))) is different from false [2023-02-15 22:27:23,673 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 ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse12 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse6 2)) (.cse5 (select .cse12 4)) (.cse7 (select .cse12 0)) (.cse9 (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (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| .cse5)) (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))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse9)) (<= .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|) (= .cse5 .cse7) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse9)) (= (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse9) (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))))) is different from true [2023-02-15 22:27:23,739 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 ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse12 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse6 2)) (.cse5 (select .cse12 4)) (.cse7 (select .cse12 0)) (.cse9 (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (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| .cse5)) (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))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse9)) (<= .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|) (= .cse5 .cse7) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse9) (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))))) is different from false [2023-02-15 22:27:23,748 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 ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse12 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse6 2)) (.cse5 (select .cse12 4)) (.cse7 (select .cse12 0)) (.cse9 (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (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| .cse5)) (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))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse9)) (<= .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|) (= .cse5 .cse7) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse9) (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))))) is different from true [2023-02-15 22:27:23,790 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 ((.cse10 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse5 2)) (.cse7 (select .cse10 4)) (.cse8 (select .cse10 0)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) .cse6))) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse7)) (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| .cse8) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse9 (select |v_#valid_BEFORE_CALL_48| .cse9))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse8) 1))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse5) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse7 .cse8) (= 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|)) (= .cse5 |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) (not (= (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) .cse6)) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset|))))) is different from false [2023-02-15 22:27:23,800 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 ((.cse10 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse4 (+ .cse5 2)) (.cse7 (select .cse10 4)) (.cse8 (select .cse10 0)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (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_arrayElimCell_268 Int)) (let ((.cse1 (+ v_arrayElimCell_267 2))) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_arrayElimCell_268) 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|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (<= .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) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) .cse6))) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse6 0) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse7)) (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| .cse8) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse9 (select |v_#valid_BEFORE_CALL_48| .cse9))) |v_#valid_BEFORE_CALL_48|) (= (select |v_#valid_BEFORE_CALL_48| .cse8) 1))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse5) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse7 .cse8) (= 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|)) (= .cse5 |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) (not (= (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) .cse6)) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset|))))) is different from true [2023-02-15 22:27:25,808 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 ((.cse7 (+ .cse0 2)) (.cse20 (select |c_#memory_$Pointer$.base| .cse0)) (.cse21 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (let ((.cse2 (select .cse20 4)) (.cse1 (select .cse20 0))) (or (let ((.cse8 (+ .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| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse2)) (= (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| .cse1) 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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |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) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (+ .cse1 2))) (and (<= .cse9 |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_arrayElimCell_268 Int)) (let ((.cse10 (+ v_arrayElimCell_267 2))) (and (<= .cse10 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (<= .cse9 |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 (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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 ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse13 (select |v_#valid_BEFORE_CALL_48| .cse13))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse1)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_268 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))) (let ((.cse18 (select .cse20 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimCell_267 2)) (.cse14 (+ .cse18 2))) (and (<= .cse14 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse15 |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_arrayElimCell_268) 0) (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse16 (select |v_#valid_BEFORE_CALL_44| .cse16))) |v_#valid_BEFORE_CALL_44|) (<= .cse14 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse17 (select |v_#valid_BEFORE_CALL_45| .cse17))) |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|)) (<= .cse15 |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) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse18)) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 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) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse19 (select |v_#valid_BEFORE_CALL_48| .cse19))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse1)))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= .cse21 0) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse0 (select .cse20 .cse21)))))) is different from false [2023-02-15 22:27:25,820 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 ((.cse7 (+ .cse0 2)) (.cse20 (select |c_#memory_$Pointer$.base| .cse0)) (.cse21 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (let ((.cse2 (select .cse20 4)) (.cse1 (select .cse20 0))) (or (let ((.cse8 (+ .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| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse2)) (= (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| .cse1) 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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |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) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (+ .cse1 2))) (and (<= .cse9 |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_arrayElimCell_268 Int)) (let ((.cse10 (+ v_arrayElimCell_267 2))) (and (<= .cse10 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (<= .cse9 |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 (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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 ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse13 (select |v_#valid_BEFORE_CALL_48| .cse13))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse1)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_268 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))) (let ((.cse18 (select .cse20 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimCell_267 2)) (.cse14 (+ .cse18 2))) (and (<= .cse14 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse15 |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_arrayElimCell_268) 0) (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse16 (select |v_#valid_BEFORE_CALL_44| .cse16))) |v_#valid_BEFORE_CALL_44|) (<= .cse14 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse17 (select |v_#valid_BEFORE_CALL_45| .cse17))) |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|)) (<= .cse15 |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) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse18)) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 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) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse19 (select |v_#valid_BEFORE_CALL_48| .cse19))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse1)))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= .cse21 0) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse0 (select .cse20 .cse21)))))) is different from true [2023-02-15 22:27:27,828 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 ((.cse7 (+ .cse0 2))) (and (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0) (let ((.cse20 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse20 4)) (.cse1 (select .cse20 0))) (or (let ((.cse8 (+ .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| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse2)) (= (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| .cse1) 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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |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) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (+ .cse1 2))) (and (<= .cse9 |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_arrayElimCell_268 Int)) (let ((.cse10 (+ v_arrayElimCell_267 2))) (and (<= .cse10 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (<= .cse9 |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 (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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 ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse13 (select |v_#valid_BEFORE_CALL_48| .cse13))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse1)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_268 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))) (let ((.cse18 (select .cse20 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimCell_267 2)) (.cse14 (+ .cse18 2))) (and (<= .cse14 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse15 |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_arrayElimCell_268) 0) (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse16 (select |v_#valid_BEFORE_CALL_44| .cse16))) |v_#valid_BEFORE_CALL_44|) (<= .cse14 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse17 (select |v_#valid_BEFORE_CALL_45| .cse17))) |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|)) (<= .cse15 |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) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse18)) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 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) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse19 (select |v_#valid_BEFORE_CALL_48| .cse19))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse1))))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse0 (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| .cse0) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 22:27:27,839 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 ((.cse7 (+ .cse0 2))) (and (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0) (let ((.cse20 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse20 4)) (.cse1 (select .cse20 0))) (or (let ((.cse8 (+ .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| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse2)) (= (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| .cse1) 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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |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) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (+ .cse1 2))) (and (<= .cse9 |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_arrayElimCell_268 Int)) (let ((.cse10 (+ v_arrayElimCell_267 2))) (and (<= .cse10 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (<= .cse9 |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 (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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 ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse13 (select |v_#valid_BEFORE_CALL_48| .cse13))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse1)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_268 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))) (let ((.cse18 (select .cse20 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimCell_267 2)) (.cse14 (+ .cse18 2))) (and (<= .cse14 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse15 |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_arrayElimCell_268) 0) (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse16 (select |v_#valid_BEFORE_CALL_44| .cse16))) |v_#valid_BEFORE_CALL_44|) (<= .cse14 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse17 (select |v_#valid_BEFORE_CALL_45| .cse17))) |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|)) (<= .cse15 |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) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse18)) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 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) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse19 (select |v_#valid_BEFORE_CALL_48| .cse19))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse1))))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse0 (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| .cse0) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-15 22:27:29,846 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 ((.cse7 (+ .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|))) (let ((.cse20 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse20 4)) (.cse1 (select .cse20 0))) (or (let ((.cse8 (+ .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| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse2)) (= (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| .cse1) 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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |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) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (+ .cse1 2))) (and (<= .cse9 |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_arrayElimCell_268 Int)) (let ((.cse10 (+ v_arrayElimCell_267 2))) (and (<= .cse10 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (<= .cse9 |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 (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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 ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse13 (select |v_#valid_BEFORE_CALL_48| .cse13))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse1)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_268 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))) (let ((.cse18 (select .cse20 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimCell_267 2)) (.cse14 (+ .cse18 2))) (and (<= .cse14 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse15 |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_arrayElimCell_268) 0) (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse16 (select |v_#valid_BEFORE_CALL_44| .cse16))) |v_#valid_BEFORE_CALL_44|) (<= .cse14 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse17 (select |v_#valid_BEFORE_CALL_45| .cse17))) |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|)) (<= .cse15 |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) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse18)) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 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) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse19 (select |v_#valid_BEFORE_CALL_48| .cse19))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse1))))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 22:27:29,858 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 ((.cse7 (+ .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|))) (let ((.cse20 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse2 (select .cse20 4)) (.cse1 (select .cse20 0))) (or (let ((.cse8 (+ .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| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse2)) (= (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| .cse1) 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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |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) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (+ .cse1 2))) (and (<= .cse9 |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_arrayElimCell_268 Int)) (let ((.cse10 (+ v_arrayElimCell_267 2))) (and (<= .cse10 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (<= .cse9 |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 (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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 ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse13 (select |v_#valid_BEFORE_CALL_48| .cse13))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse1)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_268 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))) (let ((.cse18 (select .cse20 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimCell_267 2)) (.cse14 (+ .cse18 2))) (and (<= .cse14 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse15 |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_arrayElimCell_268) 0) (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse16 (select |v_#valid_BEFORE_CALL_44| .cse16))) |v_#valid_BEFORE_CALL_44|) (<= .cse14 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse17 (select |v_#valid_BEFORE_CALL_45| .cse17))) |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|)) (<= .cse15 |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) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse18)) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 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) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse19 (select |v_#valid_BEFORE_CALL_48| .cse19))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse1))))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-15 22:27:31,865 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 ((.cse20 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (select .cse20 0)) (.cse7 (+ .cse1 2))) (and (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse0) (let ((.cse2 (select .cse20 4))) (or (let ((.cse8 (+ .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| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse0) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) .cse2)) (= (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| .cse0) 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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |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) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (+ .cse0 2))) (and (<= .cse9 |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_arrayElimCell_268 Int)) (let ((.cse10 (+ v_arrayElimCell_267 2))) (and (<= .cse10 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (<= .cse9 |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 (= (select |v_#valid_BEFORE_CALL_48| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse13 (select |v_#valid_BEFORE_CALL_48| .cse13))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) .cse0)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_268 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))) (let ((.cse18 (select .cse20 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimCell_267 2)) (.cse14 (+ .cse18 2))) (and (<= .cse14 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse15 |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_arrayElimCell_268) 0) (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse16 (select |v_#valid_BEFORE_CALL_44| .cse16))) |v_#valid_BEFORE_CALL_44|) (<= .cse14 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse17 (select |v_#valid_BEFORE_CALL_45| .cse17))) |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|)) (<= .cse15 |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) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse1)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) .cse18)) (= (select |v_#valid_BEFORE_CALL_48| .cse0) 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) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse19 (select |v_#valid_BEFORE_CALL_48| .cse19))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse0) 0) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse0)))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_main_#t~mem19#1.base|)) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 22:27:31,876 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 ((.cse20 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (select .cse20 0)) (.cse7 (+ .cse1 2))) (and (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse0) (let ((.cse2 (select .cse20 4))) (or (let ((.cse8 (+ .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| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse0) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) .cse2)) (= (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| .cse0) 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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |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) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (+ .cse0 2))) (and (<= .cse9 |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_arrayElimCell_268 Int)) (let ((.cse10 (+ v_arrayElimCell_267 2))) (and (<= .cse10 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (<= .cse9 |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 (= (select |v_#valid_BEFORE_CALL_48| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse13 (select |v_#valid_BEFORE_CALL_48| .cse13))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) .cse0)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_268 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))) (let ((.cse18 (select .cse20 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimCell_267 2)) (.cse14 (+ .cse18 2))) (and (<= .cse14 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse15 |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_arrayElimCell_268) 0) (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse16 (select |v_#valid_BEFORE_CALL_44| .cse16))) |v_#valid_BEFORE_CALL_44|) (<= .cse14 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse17 (select |v_#valid_BEFORE_CALL_45| .cse17))) |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|)) (<= .cse15 |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) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse1)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse1 1) .cse18)) (= (select |v_#valid_BEFORE_CALL_48| .cse0) 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) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse19 (select |v_#valid_BEFORE_CALL_48| .cse19))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse0) 0) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse0)))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_main_#t~mem19#1.base|)) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from true [2023-02-15 22:27:33,884 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 ((.cse20 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse1 (select .cse20 0)) (.cse7 (+ .cse0 2))) (and (let ((.cse2 (select .cse20 4))) (or (let ((.cse8 (+ .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| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse2)) (= (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| .cse1) 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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |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) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (+ .cse1 2))) (and (<= .cse9 |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_arrayElimCell_268 Int)) (let ((.cse10 (+ v_arrayElimCell_267 2))) (and (<= .cse10 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (<= .cse9 |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 (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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 ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse13 (select |v_#valid_BEFORE_CALL_48| .cse13))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse1)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_268 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))) (let ((.cse18 (select .cse20 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimCell_267 2)) (.cse14 (+ .cse18 2))) (and (<= .cse14 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse15 |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_arrayElimCell_268) 0) (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse16 (select |v_#valid_BEFORE_CALL_44| .cse16))) |v_#valid_BEFORE_CALL_44|) (<= .cse14 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse17 (select |v_#valid_BEFORE_CALL_45| .cse17))) |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|)) (<= .cse15 |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) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse18)) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 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) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse19 (select |v_#valid_BEFORE_CALL_48| .cse19))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse1)))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|)))))) is different from false [2023-02-15 22:27:33,896 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 ((.cse20 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse1 (select .cse20 0)) (.cse7 (+ .cse0 2))) (and (let ((.cse2 (select .cse20 4))) (or (let ((.cse8 (+ .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| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_54| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse2)) (= (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| .cse1) 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_arrayElimCell_268 Int)) (let ((.cse4 (+ v_arrayElimCell_267 2))) (and (<= .cse4 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse8 |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) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (+ .cse1 2))) (and (<= .cse9 |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_arrayElimCell_268 Int)) (let ((.cse10 (+ v_arrayElimCell_267 2))) (and (<= .cse10 |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_arrayElimCell_268) 0) (= (select |v_old(#valid)_AFTER_CALL_50| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) 1) (<= .cse10 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (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|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (<= .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|)) (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_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_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (<= .cse9 |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 (= (select |v_#valid_BEFORE_CALL_48| .cse2) 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 ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse13 (select |v_#valid_BEFORE_CALL_48| .cse13))) |v_#valid_BEFORE_CALL_48|) (= (select |v_old(#valid)_AFTER_CALL_54| .cse2) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse1)))))) (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14| Int) (v_arrayElimCell_267 Int) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_arrayElimCell_268 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))) (let ((.cse18 (select .cse20 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse15 (+ v_arrayElimCell_267 2)) (.cse14 (+ .cse18 2))) (and (<= .cse14 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse15 |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_arrayElimCell_268) 0) (<= .cse15 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_52| |v_#valid_BEFORE_CALL_44|))) (store |v_old(#valid)_AFTER_CALL_52| .cse16 (select |v_#valid_BEFORE_CALL_44| .cse16))) |v_#valid_BEFORE_CALL_44|) (<= .cse14 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse17 (select |v_#valid_BEFORE_CALL_45| .cse17))) |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|)) (<= .cse15 |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) (= 0 (select |v_#valid_BEFORE_CALL_48| .cse0)) (= 0 (select (store |v_#valid_BEFORE_CALL_48| .cse0 1) .cse18)) (= (select |v_#valid_BEFORE_CALL_48| .cse1) 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) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse19 (select |v_#valid_BEFORE_CALL_48| .cse19))) |v_#valid_BEFORE_CALL_48|) (not (= 0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|)) (<= .cse7 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_268) 1) (= (select |v_old(#valid)_AFTER_CALL_54| .cse1) 0) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) (= .cse2 .cse1)))) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|)))))) is different from true [2023-02-15 22:27:35,904 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)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_arrayElimCell_293 Int) (|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_54| v_arrayElimCell_293) 0) (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_293) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse0 (select |v_#valid_BEFORE_CALL_48| .cse0))) |v_#valid_BEFORE_CALL_48|) (= (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|)))) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |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_arrayElimCell_268 Int)) (let ((.cse3 (+ v_arrayElimCell_267 2))) (and (<= .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_arrayElimCell_268) 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|) (= (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|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse5 (select |v_#valid_BEFORE_CALL_45| .cse5))) |v_#valid_BEFORE_CALL_45|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (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|)) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_268) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|))))))) (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (exists ((v_prenex_121 (Array Int Int)) (v_prenex_123 (Array Int Int)) (v_prenex_124 (Array Int Int)) (v_prenex_126 (Array Int Int)) (v_prenex_127 Int) (v_prenex_129 (Array Int Int)) (v_prenex_128 Int) (v_prenex_119 (Array Int Int)) (v_prenex_125 Int) (v_arrayElimCell_295 Int) (v_prenex_122 Int) (v_prenex_120 Int)) (let ((.cse7 (+ v_prenex_127 2)) (.cse6 (+ v_arrayElimCell_295 2))) (and (= (select v_prenex_123 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (<= .cse6 v_prenex_125) (= (select v_prenex_121 v_prenex_120) 1) (= (select v_prenex_121 v_prenex_122) 0) (= (select v_prenex_126 v_prenex_122) 1) (<= .cse7 v_prenex_125) (not (= 0 v_prenex_120)) (= 0 (select v_prenex_129 |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (select v_prenex_129 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= .cse7 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse7 v_prenex_120) (= (select v_prenex_123 |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse8 (@diff v_prenex_121 v_prenex_126))) (store v_prenex_121 .cse8 (select v_prenex_126 .cse8))) v_prenex_126) (<= .cse6 v_prenex_120) (= 0 (select (store v_prenex_129 |c_ULTIMATE.start_main_#t~mem17#1.base| 1) v_arrayElimCell_295)) (<= .cse2 v_prenex_125) (<= .cse6 |ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 v_prenex_125)) (= (let ((.cse9 (@diff v_prenex_123 v_prenex_129))) (store v_prenex_123 .cse9 (select v_prenex_129 .cse9))) v_prenex_129) (<= .cse2 v_prenex_120) (= (select v_prenex_124 v_prenex_128) 1) (= (let ((.cse10 (@diff v_prenex_119 v_prenex_124))) (store v_prenex_119 .cse10 (select v_prenex_124 .cse10))) v_prenex_124) (= (select v_prenex_119 v_prenex_128) 0) (= 0 (select v_prenex_124 v_prenex_127)) (= (select v_prenex_119 v_prenex_125) 1)))) (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (<= .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|)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_293 Int)) (let ((.cse12 (+ v_arrayElimCell_293 2))) (and (exists ((v_prenex_116 Int) (v_prenex_108 (Array Int Int)) (v_prenex_117 Int) (v_prenex_114 Int) (v_prenex_111 Int) (v_prenex_110 (Array Int Int)) (v_prenex_113 (Array Int Int)) (v_prenex_109 Int) (v_prenex_115 (Array Int Int))) (let ((.cse13 (+ v_prenex_116 2))) (and (= (let ((.cse11 (@diff v_prenex_108 v_prenex_113))) (store v_prenex_108 .cse11 (select v_prenex_113 .cse11))) v_prenex_113) (= (select v_prenex_115 v_prenex_111) 1) (<= .cse12 v_prenex_109) (not (= 0 v_prenex_114)) (= (select v_prenex_113 v_prenex_117) 1) (<= .cse12 v_prenex_114) (<= .cse2 v_prenex_114) (= (select v_prenex_110 v_prenex_109) 1) (= (select v_prenex_108 v_prenex_117) 0) (<= .cse2 v_prenex_109) (<= .cse13 v_prenex_114) (= (select v_prenex_110 v_prenex_111) 0) (<= .cse13 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse13 v_prenex_109) (= (select v_prenex_108 v_prenex_114) 1) (= 0 (select v_prenex_113 v_prenex_116)) (= (let ((.cse14 (@diff v_prenex_110 v_prenex_115))) (store v_prenex_110 .cse14 (select v_prenex_115 .cse14))) v_prenex_115) (not (= 0 v_prenex_109))))) (exists ((v_prenex_118 (Array Int Int)) (v_prenex_112 (Array Int Int))) (and (= (select v_prenex_118 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= 0 (select (store v_prenex_118 |c_ULTIMATE.start_main_#t~mem17#1.base| 1) v_arrayElimCell_293)) (= (select v_prenex_112 |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse15 (@diff v_prenex_112 v_prenex_118))) (store v_prenex_112 .cse15 (select v_prenex_118 .cse15))) v_prenex_118) (= 0 (select v_prenex_118 |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (select v_prenex_112 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (<= .cse12 |ULTIMATE.start_main_~#s~0#1.base|))))))))) is different from false [2023-02-15 22:27:35,920 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)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_arrayElimCell_293 Int) (|v_old(#valid)_AFTER_CALL_54| (Array Int Int)) (|v_#valid_BEFORE_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_54| v_arrayElimCell_293) 0) (= (select |v_#valid_BEFORE_CALL_48| v_arrayElimCell_293) 1) (= 0 (select |v_#valid_BEFORE_CALL_48| |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_54| |v_#valid_BEFORE_CALL_48|))) (store |v_old(#valid)_AFTER_CALL_54| .cse0 (select |v_#valid_BEFORE_CALL_48| .cse0))) |v_#valid_BEFORE_CALL_48|) (= (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|)))) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |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_arrayElimCell_268 Int)) (let ((.cse3 (+ v_arrayElimCell_267 2))) (and (<= .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_arrayElimCell_268) 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|) (= (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|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_50| .cse5 (select |v_#valid_BEFORE_CALL_45| .cse5))) |v_#valid_BEFORE_CALL_45|) (= 0 (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_267)) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) 1) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (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|)) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_14|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|) (<= .cse1 |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_268) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_30|))))))) (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (and (exists ((v_prenex_121 (Array Int Int)) (v_prenex_123 (Array Int Int)) (v_prenex_124 (Array Int Int)) (v_prenex_126 (Array Int Int)) (v_prenex_127 Int) (v_prenex_129 (Array Int Int)) (v_prenex_128 Int) (v_prenex_119 (Array Int Int)) (v_prenex_125 Int) (v_arrayElimCell_295 Int) (v_prenex_122 Int) (v_prenex_120 Int)) (let ((.cse7 (+ v_prenex_127 2)) (.cse6 (+ v_arrayElimCell_295 2))) (and (= (select v_prenex_123 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (<= .cse6 v_prenex_125) (= (select v_prenex_121 v_prenex_120) 1) (= (select v_prenex_121 v_prenex_122) 0) (= (select v_prenex_126 v_prenex_122) 1) (<= .cse7 v_prenex_125) (not (= 0 v_prenex_120)) (= 0 (select v_prenex_129 |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (select v_prenex_129 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= .cse7 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse7 v_prenex_120) (= (select v_prenex_123 |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse8 (@diff v_prenex_121 v_prenex_126))) (store v_prenex_121 .cse8 (select v_prenex_126 .cse8))) v_prenex_126) (<= .cse6 v_prenex_120) (= 0 (select (store v_prenex_129 |c_ULTIMATE.start_main_#t~mem17#1.base| 1) v_arrayElimCell_295)) (<= .cse2 v_prenex_125) (<= .cse6 |ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 v_prenex_125)) (= (let ((.cse9 (@diff v_prenex_123 v_prenex_129))) (store v_prenex_123 .cse9 (select v_prenex_129 .cse9))) v_prenex_129) (<= .cse2 v_prenex_120) (= (select v_prenex_124 v_prenex_128) 1) (= (let ((.cse10 (@diff v_prenex_119 v_prenex_124))) (store v_prenex_119 .cse10 (select v_prenex_124 .cse10))) v_prenex_124) (= (select v_prenex_119 v_prenex_128) 0) (= 0 (select v_prenex_124 v_prenex_127)) (= (select v_prenex_119 v_prenex_125) 1)))) (not (= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (<= .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|)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_293 Int)) (let ((.cse12 (+ v_arrayElimCell_293 2))) (and (exists ((v_prenex_116 Int) (v_prenex_108 (Array Int Int)) (v_prenex_117 Int) (v_prenex_114 Int) (v_prenex_111 Int) (v_prenex_110 (Array Int Int)) (v_prenex_113 (Array Int Int)) (v_prenex_109 Int) (v_prenex_115 (Array Int Int))) (let ((.cse13 (+ v_prenex_116 2))) (and (= (let ((.cse11 (@diff v_prenex_108 v_prenex_113))) (store v_prenex_108 .cse11 (select v_prenex_113 .cse11))) v_prenex_113) (= (select v_prenex_115 v_prenex_111) 1) (<= .cse12 v_prenex_109) (not (= 0 v_prenex_114)) (= (select v_prenex_113 v_prenex_117) 1) (<= .cse12 v_prenex_114) (<= .cse2 v_prenex_114) (= (select v_prenex_110 v_prenex_109) 1) (= (select v_prenex_108 v_prenex_117) 0) (<= .cse2 v_prenex_109) (<= .cse13 v_prenex_114) (= (select v_prenex_110 v_prenex_111) 0) (<= .cse13 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse13 v_prenex_109) (= (select v_prenex_108 v_prenex_114) 1) (= 0 (select v_prenex_113 v_prenex_116)) (= (let ((.cse14 (@diff v_prenex_110 v_prenex_115))) (store v_prenex_110 .cse14 (select v_prenex_115 .cse14))) v_prenex_115) (not (= 0 v_prenex_109))))) (exists ((v_prenex_118 (Array Int Int)) (v_prenex_112 (Array Int Int))) (and (= (select v_prenex_118 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= 0 (select (store v_prenex_118 |c_ULTIMATE.start_main_#t~mem17#1.base| 1) v_arrayElimCell_293)) (= (select v_prenex_112 |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse15 (@diff v_prenex_112 v_prenex_118))) (store v_prenex_112 .cse15 (select v_prenex_118 .cse15))) v_prenex_118) (= 0 (select v_prenex_118 |c_ULTIMATE.start_main_#t~mem17#1.base|)) (= (select v_prenex_112 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (<= .cse12 |ULTIMATE.start_main_~#s~0#1.base|))))))))) is different from true [2023-02-15 22:27:37,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:27:37,035 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2023-02-15 22:27:37,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-02-15 22:27:37,036 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-15 22:27:37,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:27:37,037 INFO L225 Difference]: With dead ends: 106 [2023-02-15 22:27:37,037 INFO L226 Difference]: Without dead ends: 106 [2023-02-15 22:27:37,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 126 ConstructedPredicates, 81 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 37.7s TimeCoverageRelationStatistics Valid=311, Invalid=1996, Unknown=179, NotChecked=13770, Total=16256 [2023-02-15 22:27:37,038 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 7 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 2508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1888 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:27:37,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1077 Invalid, 2508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 618 Invalid, 0 Unknown, 1888 Unchecked, 2.0s Time] [2023-02-15 22:27:37,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-15 22:27:37,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-02-15 22:27:37,040 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-15 22:27:37,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2023-02-15 22:27:37,040 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 66 [2023-02-15 22:27:37,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:27:37,040 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2023-02-15 22:27:37,040 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-15 22:27:37,040 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2023-02-15 22:27:37,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-15 22:27:37,041 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:27:37,041 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-15 22:27:37,050 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-15 22:27:37,250 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-15 22:27:37,250 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-15 22:27:37,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:27:37,251 INFO L85 PathProgramCache]: Analyzing trace with hash 792357101, now seen corresponding path program 1 times [2023-02-15 22:27:37,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:27:37,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876521153] [2023-02-15 22:27:37,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:37,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:27:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:49,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:27:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:50,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 22:27:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:52,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 22:27:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:55,065 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-15 22:27:55,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:27:55,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876521153] [2023-02-15 22:27:55,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876521153] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:55,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742478589] [2023-02-15 22:27:55,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:55,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:27:55,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:27:55,067 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-15 22:27:55,069 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-15 22:27:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:55,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 235 conjunts are in the unsatisfiable core [2023-02-15 22:27:55,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:27:55,460 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-15 22:27:55,807 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-15 22:27:56,106 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-15 22:27:56,481 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-15 22:27:57,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:57,195 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-15 22:27:58,159 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-15 22:27:58,168 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-15 22:27:58,177 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