./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 19:45:03,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:45:03,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:45:03,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:45:03,069 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:45:03,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:45:03,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:45:03,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:45:03,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:45:03,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:45:03,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:45:03,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:45:03,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:45:03,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:45:03,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:45:03,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:45:03,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:45:03,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:45:03,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:45:03,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:45:03,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:45:03,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:45:03,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:45:03,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:45:03,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:45:03,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:45:03,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:45:03,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:45:03,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:45:03,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:45:03,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:45:03,104 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:45:03,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:45:03,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:45:03,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:45:03,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:45:03,107 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:45:03,107 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:45:03,107 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:45:03,108 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:45:03,108 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:45:03,109 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:45:03,127 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:45:03,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:45:03,127 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:45:03,127 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:45:03,128 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:45:03,128 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:45:03,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:45:03,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:45:03,129 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:45:03,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:45:03,130 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:45:03,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:45:03,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:45:03,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:45:03,131 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:45:03,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:45:03,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:45:03,131 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:45:03,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:45:03,131 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:45:03,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:45:03,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:45:03,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:45:03,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:45:03,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:45:03,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:45:03,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:45:03,133 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:45:03,133 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:45:03,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:45:03,133 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:45:03,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:45:03,133 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:45:03,134 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:45:03,134 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:45:03,134 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2023-02-15 19:45:03,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:45:03,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:45:03,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:45:03,352 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:45:03,352 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:45:03,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2023-02-15 19:45:04,265 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:45:04,484 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:45:04,484 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2023-02-15 19:45:04,494 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff7c21ffe/4b783681d5ab4e14a858773d44e5416b/FLAG5b3d4e230 [2023-02-15 19:45:04,503 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff7c21ffe/4b783681d5ab4e14a858773d44e5416b [2023-02-15 19:45:04,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:45:04,506 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:45:04,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:45:04,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:45:04,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:45:04,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:45:04" (1/1) ... [2023-02-15 19:45:04,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28dfc7b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:45:04, skipping insertion in model container [2023-02-15 19:45:04,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:45:04" (1/1) ... [2023-02-15 19:45:04,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:45:04,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:45:04,715 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/dll2n_append_equal.i[24333,24346] [2023-02-15 19:45:04,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:45:04,723 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:45:04,761 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/dll2n_append_equal.i[24333,24346] [2023-02-15 19:45:04,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:45:04,785 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:45:04,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:45:04 WrapperNode [2023-02-15 19:45:04,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:45:04,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:45:04,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:45:04,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:45:04,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:45:04" (1/1) ... [2023-02-15 19:45:04,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:45:04" (1/1) ... [2023-02-15 19:45:04,831 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 122 [2023-02-15 19:45:04,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:45:04,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:45:04,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:45:04,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:45:04,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:45:04" (1/1) ... [2023-02-15 19:45:04,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:45:04" (1/1) ... [2023-02-15 19:45:04,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:45:04" (1/1) ... [2023-02-15 19:45:04,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:45:04" (1/1) ... [2023-02-15 19:45:04,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:45:04" (1/1) ... [2023-02-15 19:45:04,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:45:04" (1/1) ... [2023-02-15 19:45:04,858 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:45:04" (1/1) ... [2023-02-15 19:45:04,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:45:04" (1/1) ... [2023-02-15 19:45:04,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:45:04,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:45:04,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:45:04,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:45:04,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:45:04" (1/1) ... [2023-02-15 19:45:04,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:45:04,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:45:04,898 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 19:45:04,916 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 19:45:04,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 19:45:04,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 19:45:04,925 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 19:45:04,926 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 19:45:04,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:45:04,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:45:04,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 19:45:04,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 19:45:04,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 19:45:04,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 19:45:04,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 19:45:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:45:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:45:04,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:45:05,037 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:45:05,048 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:45:05,210 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:45:05,214 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:45:05,214 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 19:45:05,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:45:05 BoogieIcfgContainer [2023-02-15 19:45:05,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:45:05,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:45:05,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:45:05,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:45:05,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:45:04" (1/3) ... [2023-02-15 19:45:05,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6055a46f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:45:05, skipping insertion in model container [2023-02-15 19:45:05,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:45:04" (2/3) ... [2023-02-15 19:45:05,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6055a46f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:45:05, skipping insertion in model container [2023-02-15 19:45:05,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:45:05" (3/3) ... [2023-02-15 19:45:05,231 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2023-02-15 19:45:05,243 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:45:05,243 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:45:05,285 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:45:05,289 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7004f4ae, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:45:05,290 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:45:05,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:45:05,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 19:45:05,297 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:45:05,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:45:05,298 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:45:05,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:45:05,301 INFO L85 PathProgramCache]: Analyzing trace with hash 308507763, now seen corresponding path program 1 times [2023-02-15 19:45:05,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:45:05,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015112940] [2023-02-15 19:45:05,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:45:05,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:45:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:05,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:45:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:05,488 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 19:45:05,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:45:05,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015112940] [2023-02-15 19:45:05,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015112940] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:45:05,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:45:05,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:45:05,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790174379] [2023-02-15 19:45:05,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:45:05,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:45:05,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:45:05,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:45:05,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:45:05,513 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:45:05,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:45:05,554 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2023-02-15 19:45:05,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:45:05,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-02-15 19:45:05,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:45:05,560 INFO L225 Difference]: With dead ends: 57 [2023-02-15 19:45:05,560 INFO L226 Difference]: Without dead ends: 26 [2023-02-15 19:45:05,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:45:05,566 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:45:05,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:45:05,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-15 19:45:05,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-02-15 19:45:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:45:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-02-15 19:45:05,592 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2023-02-15 19:45:05,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:45:05,592 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-02-15 19:45:05,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:45:05,593 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-02-15 19:45:05,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 19:45:05,595 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:45:05,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:45:05,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 19:45:05,595 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:45:05,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:45:05,597 INFO L85 PathProgramCache]: Analyzing trace with hash -2109805219, now seen corresponding path program 1 times [2023-02-15 19:45:05,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:45:05,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588155439] [2023-02-15 19:45:05,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:45:05,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:45:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:05,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:45:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:05,708 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 19:45:05,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:45:05,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588155439] [2023-02-15 19:45:05,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588155439] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:45:05,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:45:05,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:45:05,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790747014] [2023-02-15 19:45:05,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:45:05,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:45:05,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:45:05,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:45:05,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:45:05,714 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:45:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:45:05,749 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2023-02-15 19:45:05,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:45:05,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-02-15 19:45:05,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:45:05,751 INFO L225 Difference]: With dead ends: 50 [2023-02-15 19:45:05,753 INFO L226 Difference]: Without dead ends: 31 [2023-02-15 19:45:05,753 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 19:45:05,754 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:45:05,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 70 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:45:05,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-15 19:45:05,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2023-02-15 19:45:05,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:45:05,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-02-15 19:45:05,759 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2023-02-15 19:45:05,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:45:05,759 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-02-15 19:45:05,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:45:05,760 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-02-15 19:45:05,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 19:45:05,760 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:45:05,760 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:45:05,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 19:45:05,761 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:45:05,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:45:05,761 INFO L85 PathProgramCache]: Analyzing trace with hash 493100305, now seen corresponding path program 1 times [2023-02-15 19:45:05,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:45:05,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445683022] [2023-02-15 19:45:05,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:45:05,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:45:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:05,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:45:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:05,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-15 19:45:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:05,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:45:05,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:45:05,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445683022] [2023-02-15 19:45:05,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445683022] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:45:05,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:45:05,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:45:05,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545096577] [2023-02-15 19:45:05,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:45:05,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:45:05,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:45:05,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:45:05,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:45:05,855 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:45:05,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:45:05,887 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2023-02-15 19:45:05,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:45:05,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2023-02-15 19:45:05,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:45:05,888 INFO L225 Difference]: With dead ends: 55 [2023-02-15 19:45:05,888 INFO L226 Difference]: Without dead ends: 31 [2023-02-15 19:45:05,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:45:05,889 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:45:05,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:45:05,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-15 19:45:05,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2023-02-15 19:45:05,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 19:45:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-02-15 19:45:05,894 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 27 [2023-02-15 19:45:05,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:45:05,894 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-02-15 19:45:05,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:45:05,894 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-02-15 19:45:05,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 19:45:05,895 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:45:05,895 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:45:05,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 19:45:05,895 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:45:05,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:45:05,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1095247597, now seen corresponding path program 1 times [2023-02-15 19:45:05,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:45:05,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013672110] [2023-02-15 19:45:05,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:45:05,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:45:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:06,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:45:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:06,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-15 19:45:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:45:06,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:45:06,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013672110] [2023-02-15 19:45:06,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013672110] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:45:06,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55472298] [2023-02-15 19:45:06,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:45:06,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:45:06,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:45:06,063 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 19:45:06,084 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 19:45:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:06,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 19:45:06,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:45:06,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:45:06,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:45:06,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:45:06,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55472298] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:45:06,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:45:06,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-02-15 19:45:06,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599331297] [2023-02-15 19:45:06,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:45:06,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:45:06,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:45:06,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:45:06,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:45:06,290 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 19:45:06,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:45:06,348 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2023-02-15 19:45:06,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:45:06,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2023-02-15 19:45:06,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:45:06,350 INFO L225 Difference]: With dead ends: 51 [2023-02-15 19:45:06,350 INFO L226 Difference]: Without dead ends: 32 [2023-02-15 19:45:06,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:45:06,351 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:45:06,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 72 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:45:06,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-15 19:45:06,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-15 19:45:06,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 19:45:06,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2023-02-15 19:45:06,360 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 27 [2023-02-15 19:45:06,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:45:06,361 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2023-02-15 19:45:06,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 19:45:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2023-02-15 19:45:06,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 19:45:06,362 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:45:06,362 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:45:06,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 19:45:06,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:45:06,567 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:45:06,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:45:06,568 INFO L85 PathProgramCache]: Analyzing trace with hash -292922041, now seen corresponding path program 1 times [2023-02-15 19:45:06,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:45:06,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582117684] [2023-02-15 19:45:06,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:45:06,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:45:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:06,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:45:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:06,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:45:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:06,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:45:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-15 19:45:06,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:45:06,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582117684] [2023-02-15 19:45:06,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582117684] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:45:06,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:45:06,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 19:45:06,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394280224] [2023-02-15 19:45:06,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:45:06,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 19:45:06,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:45:06,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 19:45:06,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-15 19:45:06,913 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:45:07,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:45:07,017 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2023-02-15 19:45:07,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 19:45:07,017 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2023-02-15 19:45:07,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:45:07,019 INFO L225 Difference]: With dead ends: 45 [2023-02-15 19:45:07,019 INFO L226 Difference]: Without dead ends: 42 [2023-02-15 19:45:07,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-02-15 19:45:07,021 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 64 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:45:07,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 130 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:45:07,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-15 19:45:07,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2023-02-15 19:45:07,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 19:45:07,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2023-02-15 19:45:07,033 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 37 [2023-02-15 19:45:07,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:45:07,034 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2023-02-15 19:45:07,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:45:07,035 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2023-02-15 19:45:07,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 19:45:07,037 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:45:07,037 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:45:07,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 19:45:07,038 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:45:07,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:45:07,038 INFO L85 PathProgramCache]: Analyzing trace with hash -292920367, now seen corresponding path program 1 times [2023-02-15 19:45:07,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:45:07,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736351915] [2023-02-15 19:45:07,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:45:07,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:45:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:07,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:45:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:07,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:45:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:07,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:45:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:45:07,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:45:07,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736351915] [2023-02-15 19:45:07,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736351915] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:45:07,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308525588] [2023-02-15 19:45:07,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:45:07,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:45:07,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:45:07,532 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 19:45:07,534 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 19:45:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:07,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-15 19:45:07,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:45:07,927 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 19:45:07,971 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_652 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_652))))) is different from true [2023-02-15 19:45:07,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:08,000 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 19:45:08,039 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 19:45:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2023-02-15 19:45:08,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:45:08,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308525588] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:45:08,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:45:08,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2023-02-15 19:45:08,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751004856] [2023-02-15 19:45:08,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:45:08,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 19:45:08,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:45:08,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 19:45:08,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=4, NotChecked=48, Total=702 [2023-02-15 19:45:08,153 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 19:45:08,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:45:08,544 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2023-02-15 19:45:08,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 19:45:08,545 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2023-02-15 19:45:08,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:45:08,546 INFO L225 Difference]: With dead ends: 58 [2023-02-15 19:45:08,546 INFO L226 Difference]: Without dead ends: 32 [2023-02-15 19:45:08,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=893, Unknown=4, NotChecked=62, Total=1122 [2023-02-15 19:45:08,547 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 77 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:45:08,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 173 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 285 Invalid, 0 Unknown, 32 Unchecked, 0.2s Time] [2023-02-15 19:45:08,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-15 19:45:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-15 19:45:08,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 19:45:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-02-15 19:45:08,551 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 37 [2023-02-15 19:45:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:45:08,551 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-02-15 19:45:08,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 19:45:08,551 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-02-15 19:45:08,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 19:45:08,552 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:45:08,552 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:45:08,565 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 19:45:08,752 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,SelfDestructingSolverStorable5 [2023-02-15 19:45:08,752 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:45:08,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:45:08,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1499731437, now seen corresponding path program 1 times [2023-02-15 19:45:08,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:45:08,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621881680] [2023-02-15 19:45:08,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:45:08,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:45:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:09,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:45:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:09,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:45:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:09,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:45:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:09,379 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:45:09,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:45:09,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621881680] [2023-02-15 19:45:09,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621881680] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:45:09,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324422159] [2023-02-15 19:45:09,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:45:09,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:45:09,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:45:09,382 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 19:45:09,412 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 19:45:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:09,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-15 19:45:09,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:45:09,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-15 19:45:09,736 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_892 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_892)))) is different from true [2023-02-15 19:45:09,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:09,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-02-15 19:45:09,883 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2023-02-15 19:45:09,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2023-02-15 19:45:09,901 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 19:45:09,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 42 [2023-02-15 19:45:09,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 19:45:09,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 19:45:09,920 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2023-02-15 19:45:09,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:45:10,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324422159] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:45:10,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:45:10,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 32 [2023-02-15 19:45:10,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627012525] [2023-02-15 19:45:10,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:45:10,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-15 19:45:10,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:45:10,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-15 19:45:10,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1142, Unknown=17, NotChecked=68, Total=1332 [2023-02-15 19:45:10,206 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 32 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 19:45:11,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:45:11,270 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2023-02-15 19:45:11,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 19:45:11,271 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2023-02-15 19:45:11,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:45:11,271 INFO L225 Difference]: With dead ends: 52 [2023-02-15 19:45:11,271 INFO L226 Difference]: Without dead ends: 49 [2023-02-15 19:45:11,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=405, Invalid=2444, Unknown=17, NotChecked=104, Total=2970 [2023-02-15 19:45:11,273 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 322 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 19:45:11,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 180 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 475 Invalid, 0 Unknown, 37 Unchecked, 0.3s Time] [2023-02-15 19:45:11,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-02-15 19:45:11,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2023-02-15 19:45:11,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 19:45:11,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-02-15 19:45:11,278 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 40 [2023-02-15 19:45:11,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:45:11,279 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-02-15 19:45:11,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 19:45:11,279 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-02-15 19:45:11,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 19:45:11,279 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:45:11,279 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:45:11,295 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 19:45:11,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:45:11,493 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:45:11,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:45:11,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1499729763, now seen corresponding path program 1 times [2023-02-15 19:45:11,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:45:11,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841891209] [2023-02-15 19:45:11,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:45:11,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:45:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:12,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:45:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:12,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:45:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:12,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:45:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:12,671 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:45:12,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:45:12,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841891209] [2023-02-15 19:45:12,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841891209] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:45:12,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268911902] [2023-02-15 19:45:12,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:45:12,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:45:12,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:45:12,685 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 19:45:12,687 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 19:45:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:12,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 112 conjunts are in the unsatisfiable core [2023-02-15 19:45:12,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:45:12,989 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 19:45:13,236 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:45:13,236 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 21 [2023-02-15 19:45:13,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:13,314 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 16 treesize of output 17 [2023-02-15 19:45:13,380 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 19:45:13,689 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 44 treesize of output 24 [2023-02-15 19:45:13,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 19:45:13,695 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 19:45:13,707 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 19:45:13,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:13,843 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 46 [2023-02-15 19:45:13,856 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 19:45:13,857 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 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 19:45:13,863 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 19:45:13,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:13,874 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 19:45:14,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:14,223 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 19:45:14,224 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 4 case distinctions, treesize of input 111 treesize of output 96 [2023-02-15 19:45:14,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:14,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-02-15 19:45:14,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:14,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-02-15 19:45:14,242 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 19:45:14,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:14,246 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 19:45:14,306 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 36 treesize of output 20 [2023-02-15 19:45:14,310 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 19:45:14,348 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 19:45:14,380 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:45:14,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:45:19,092 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| Int) (v_ArrVal_1151 Int) (v_ArrVal_1148 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1149 Int) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_9| Int) (v_ArrVal_1150 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1166))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1165)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_9| 4))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16|))) (not (= 0 (select (select .cse0 .cse1) .cse2))) (not (<= (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) |v_ULTIMATE.start_dll_append_~last~0#1.offset_9|)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| |c_#StackHeapBarrier|)) (= (select (select (store (let ((.cse4 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1164))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_ArrVal_1149))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1150) (select (select (store (store .cse0 .cse1 v_ArrVal_1155) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1153) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_1151)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1148) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))))) is different from false [2023-02-15 19:45:19,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268911902] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:45:19,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:45:19,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 48 [2023-02-15 19:45:19,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512983774] [2023-02-15 19:45:19,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:45:19,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-02-15 19:45:19,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:45:19,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-15 19:45:19,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2545, Unknown=31, NotChecked=102, Total=2862 [2023-02-15 19:45:19,096 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 48 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 39 states have internal predecessors, (62), 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 19:45:21,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:45:21,401 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2023-02-15 19:45:21,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 19:45:21,401 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 39 states have internal predecessors, (62), 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 40 [2023-02-15 19:45:21,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:45:21,402 INFO L225 Difference]: With dead ends: 50 [2023-02-15 19:45:21,402 INFO L226 Difference]: Without dead ends: 48 [2023-02-15 19:45:21,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=542, Invalid=4401, Unknown=31, NotChecked=138, Total=5112 [2023-02-15 19:45:21,404 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 181 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 19:45:21,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 249 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 19:45:21,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-15 19:45:21,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2023-02-15 19:45:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 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 19:45:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2023-02-15 19:45:21,411 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 40 [2023-02-15 19:45:21,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:45:21,411 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2023-02-15 19:45:21,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 39 states have internal predecessors, (62), 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 19:45:21,411 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2023-02-15 19:45:21,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 19:45:21,412 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:45:21,412 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:45:21,424 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 19:45:21,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:45:21,618 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:45:21,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:45:21,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1868742190, now seen corresponding path program 1 times [2023-02-15 19:45:21,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:45:21,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594534812] [2023-02-15 19:45:21,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:45:21,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:45:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:22,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:45:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:22,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:45:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:22,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:45:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:22,415 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 19:45:22,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:45:22,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594534812] [2023-02-15 19:45:22,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594534812] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:45:22,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676425234] [2023-02-15 19:45:22,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:45:22,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:45:22,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:45:22,417 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 19:45:22,419 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 19:45:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:22,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 93 conjunts are in the unsatisfiable core [2023-02-15 19:45:22,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:45:22,580 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 19:45:22,816 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:45:22,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 19:45:22,874 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 13 treesize of output 9 [2023-02-15 19:45:22,928 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:45:22,928 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 44 treesize of output 43 [2023-02-15 19:45:23,165 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:45:23,166 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 66 treesize of output 29 [2023-02-15 19:45:23,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:45:23,174 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 19:45:23,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:23,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 19:45:23,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:23,287 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:45:23,287 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 74 treesize of output 62 [2023-02-15 19:45:23,301 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 19:45:23,301 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 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 19:45:23,556 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 19:45:23,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2023-02-15 19:45:23,585 INFO L321 Elim1Store]: treesize reduction 90, result has 14.3 percent of original size [2023-02-15 19:45:23,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 61 [2023-02-15 19:45:23,613 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2023-02-15 19:45:23,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 103 [2023-02-15 19:45:23,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:23,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 19:45:23,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2023-02-15 19:45:23,677 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 19:45:23,740 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:45:23,741 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 57 treesize of output 24 [2023-02-15 19:45:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:45:23,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:45:24,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676425234] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:45:24,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:45:24,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 45 [2023-02-15 19:45:24,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117716425] [2023-02-15 19:45:24,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:45:24,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-15 19:45:24,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:45:24,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-15 19:45:24,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2468, Unknown=4, NotChecked=0, Total=2652 [2023-02-15 19:45:24,220 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 45 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 37 states have internal predecessors, (66), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 19:45:26,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:45:26,758 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2023-02-15 19:45:26,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 19:45:26,759 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 37 states have internal predecessors, (66), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2023-02-15 19:45:26,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:45:26,759 INFO L225 Difference]: With dead ends: 55 [2023-02-15 19:45:26,759 INFO L226 Difference]: Without dead ends: 46 [2023-02-15 19:45:26,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=572, Invalid=4680, Unknown=4, NotChecked=0, Total=5256 [2023-02-15 19:45:26,761 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 232 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 19:45:26,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 257 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 19:45:26,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-15 19:45:26,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2023-02-15 19:45:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 19:45:26,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2023-02-15 19:45:26,768 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 42 [2023-02-15 19:45:26,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:45:26,768 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-02-15 19:45:26,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 37 states have internal predecessors, (66), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 19:45:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2023-02-15 19:45:26,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 19:45:26,769 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:45:26,769 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:45:26,776 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 19:45:26,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:45:26,977 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:45:26,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:45:26,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1422189688, now seen corresponding path program 1 times [2023-02-15 19:45:26,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:45:26,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084579377] [2023-02-15 19:45:26,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:45:26,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:45:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:28,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:45:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:28,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:45:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:28,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:45:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:45:29,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:45:29,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084579377] [2023-02-15 19:45:29,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084579377] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:45:29,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147804106] [2023-02-15 19:45:29,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:45:29,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:45:29,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:45:29,115 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 19:45:29,117 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 19:45:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:29,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 133 conjunts are in the unsatisfiable core [2023-02-15 19:45:29,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:45:29,426 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 19:45:29,471 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 19:45:29,569 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:45:29,569 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 19:45:29,743 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 19:45:29,850 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 19:45:29,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-15 19:45:29,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:29,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-02-15 19:45:29,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 19:45:30,018 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:45:30,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2023-02-15 19:45:30,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 19:45:30,373 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:45:30,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 37 [2023-02-15 19:45:30,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 19:45:30,391 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 19:45:30,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:30,598 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:45:30,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 70 [2023-02-15 19:45:30,614 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 19:45:30,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2023-02-15 19:45:30,620 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 19:45:30,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:30,634 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 19:45:30,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 19:45:30,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:30,645 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 19:45:31,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:31,215 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:45:31,237 INFO L321 Elim1Store]: treesize reduction 139, result has 14.7 percent of original size [2023-02-15 19:45:31,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 210 treesize of output 104 [2023-02-15 19:45:31,263 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-15 19:45:31,263 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 292 treesize of output 183 [2023-02-15 19:45:31,283 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 19:45:31,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 246 treesize of output 197 [2023-02-15 19:45:31,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2023-02-15 19:45:31,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:31,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 19:45:31,416 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2023-02-15 19:45:31,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 46 [2023-02-15 19:45:31,422 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 19:45:31,473 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 19:45:31,512 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:45:31,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:45:31,537 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1676 (Array Int Int)) (v_ArrVal_1675 (Array Int Int)) (v_ArrVal_1683 Int) (v_ArrVal_1684 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1675) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1676) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1678) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1683)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1684) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 19:45:32,111 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1678 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| Int) (v_ArrVal_1676 (Array Int Int)) (v_ArrVal_1675 (Array Int Int)) (v_ArrVal_1683 Int) (v_ArrVal_1695 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_12| Int) (v_ArrVal_1684 (Array Int Int)) (v_ArrVal_1694 (Array Int Int)) (v_ArrVal_1693 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1695)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1694))) (let ((.cse2 (select (select .cse3 (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse0 (select .cse3 .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_12| 4))) (or (not (= 0 (select .cse0 .cse1))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22|))) (= (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1693) .cse2 v_ArrVal_1675) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1676) (select (select (store (store .cse3 .cse2 (store .cse0 .cse1 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1678) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse2 (store (select .cse4 .cse2) .cse1 v_ArrVal_1683)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_22| v_ArrVal_1684) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)))))) is different from false [2023-02-15 19:45:32,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147804106] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:45:32,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:45:32,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 56 [2023-02-15 19:45:32,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25559411] [2023-02-15 19:45:32,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:45:32,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-02-15 19:45:32,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:45:32,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-02-15 19:45:32,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=3468, Unknown=3, NotChecked=238, Total=3906 [2023-02-15 19:45:32,115 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 56 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 47 states have internal predecessors, (70), 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 19:45:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:45:37,526 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2023-02-15 19:45:37,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 19:45:37,527 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 47 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2023-02-15 19:45:37,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:45:37,528 INFO L225 Difference]: With dead ends: 55 [2023-02-15 19:45:37,528 INFO L226 Difference]: Without dead ends: 53 [2023-02-15 19:45:37,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1398 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=671, Invalid=6306, Unknown=3, NotChecked=330, Total=7310 [2023-02-15 19:45:37,530 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 310 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-15 19:45:37,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 300 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-02-15 19:45:37,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-15 19:45:37,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2023-02-15 19:45:37,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 19:45:37,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2023-02-15 19:45:37,545 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 42 [2023-02-15 19:45:37,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:45:37,546 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-02-15 19:45:37,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 47 states have internal predecessors, (70), 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 19:45:37,546 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2023-02-15 19:45:37,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 19:45:37,547 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:45:37,547 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:45:37,556 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 19:45:37,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:45:37,749 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:45:37,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:45:37,750 INFO L85 PathProgramCache]: Analyzing trace with hash 924724691, now seen corresponding path program 1 times [2023-02-15 19:45:37,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:45:37,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591305980] [2023-02-15 19:45:37,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:45:37,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:45:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:39,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:45:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:39,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:45:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:39,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:45:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:39,870 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:45:39,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:45:39,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591305980] [2023-02-15 19:45:39,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591305980] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:45:39,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990672454] [2023-02-15 19:45:39,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:45:39,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:45:39,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:45:39,872 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 19:45:39,874 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 19:45:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:40,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 161 conjunts are in the unsatisfiable core [2023-02-15 19:45:40,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:45:40,313 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 19:45:40,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:40,464 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 16 treesize of output 17 [2023-02-15 19:45:40,594 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 19:45:40,596 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 19:45:40,769 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:45:40,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 19:45:40,788 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 19:45:40,859 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 13 treesize of output 9 [2023-02-15 19:45:40,873 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 13 treesize of output 9 [2023-02-15 19:45:40,880 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 19:45:40,982 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:45:40,982 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 109 treesize of output 98 [2023-02-15 19:45:40,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:40,988 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 45 treesize of output 38 [2023-02-15 19:45:40,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 19:45:41,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:45:41,397 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 103 treesize of output 46 [2023-02-15 19:45:41,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 19:45:41,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:45:41,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:41,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 19:45:41,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:41,578 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:45:41,578 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 113 treesize of output 87 [2023-02-15 19:45:41,592 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 19:45:41,592 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 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 19:45:41,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:41,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:41,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 19:45:41,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 19:45:42,326 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:45:42,374 INFO L321 Elim1Store]: treesize reduction 135, result has 17.2 percent of original size [2023-02-15 19:45:42,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 277 treesize of output 141 [2023-02-15 19:45:42,409 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-15 19:45:42,409 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 341 treesize of output 212 [2023-02-15 19:45:42,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:42,443 INFO L321 Elim1Store]: treesize reduction 120, result has 15.5 percent of original size [2023-02-15 19:45:42,443 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 6 new quantified variables, introduced 4 case distinctions, treesize of input 249 treesize of output 205 [2023-02-15 19:45:42,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:42,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2023-02-15 19:45:42,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:42,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:42,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-02-15 19:45:42,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2023-02-15 19:45:42,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:42,747 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:45:42,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:42,753 INFO L321 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2023-02-15 19:45:42,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 186 treesize of output 75 [2023-02-15 19:45:42,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:42,764 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 19:45:42,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2023-02-15 19:45:42,832 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 19:45:42,886 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:45:42,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:45:45,413 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1965 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_25| Int) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1964 Int) (v_ArrVal_1958 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_15| Int) (v_ArrVal_1955 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_25| v_ArrVal_1975)) (.cse11 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_25| v_ArrVal_1976))) (let ((.cse3 (select (select .cse11 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse4 (+ (select (select .cse2 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse6 (select (select .cse11 .cse3) .cse4))) (let ((.cse0 (select .cse11 .cse6)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_15| 4))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_25| |c_#StackHeapBarrier|)) (not (= 0 (select .cse0 .cse1))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_25|))) (not (<= (select (select .cse2 .cse3) .cse4) |v_ULTIMATE.start_dll_append_~last~0#1.offset_15|)) (= (let ((.cse10 (store (store .cse2 .cse6 (store (select .cse2 .cse6) .cse1 v_ArrVal_1964)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_25| v_ArrVal_1965)) (.cse7 (store (store .cse11 .cse6 (store .cse0 .cse1 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_25|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_25| v_ArrVal_1958))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (+ (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse5 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_25| v_ArrVal_1974))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse1 v_ArrVal_1955))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_25| v_ArrVal_1960) (select (select .cse7 .cse8) .cse9)) (select (select .cse10 .cse8) .cse9)))) |c_ULTIMATE.start_main_~data~0#1|))))))) is different from false [2023-02-15 19:45:45,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990672454] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:45:45,419 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:45:45,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 55 [2023-02-15 19:45:45,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909351213] [2023-02-15 19:45:45,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:45:45,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-02-15 19:45:45,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:45:45,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-02-15 19:45:45,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3653, Unknown=44, NotChecked=122, Total=4032 [2023-02-15 19:45:45,421 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 55 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 46 states have internal predecessors, (73), 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 19:45:48,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 19:45:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:45:53,281 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2023-02-15 19:45:53,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 19:45:53,282 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 46 states have internal predecessors, (73), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2023-02-15 19:45:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:45:53,282 INFO L225 Difference]: With dead ends: 56 [2023-02-15 19:45:53,283 INFO L226 Difference]: Without dead ends: 54 [2023-02-15 19:45:53,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=713, Invalid=6903, Unknown=44, NotChecked=172, Total=7832 [2023-02-15 19:45:53,284 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 268 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-02-15 19:45:53,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 339 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-02-15 19:45:53,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-15 19:45:53,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2023-02-15 19:45:53,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 19:45:53,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2023-02-15 19:45:53,295 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 44 [2023-02-15 19:45:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:45:53,295 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2023-02-15 19:45:53,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 46 states have internal predecessors, (73), 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 19:45:53,295 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2023-02-15 19:45:53,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 19:45:53,295 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:45:53,295 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:45:53,305 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 19:45:53,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:45:53,503 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:45:53,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:45:53,503 INFO L85 PathProgramCache]: Analyzing trace with hash 478170515, now seen corresponding path program 2 times [2023-02-15 19:45:53,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:45:53,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912440794] [2023-02-15 19:45:53,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:45:53,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:45:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:55,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:45:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:55,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:45:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:55,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:45:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:45:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:45:55,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:45:55,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912440794] [2023-02-15 19:45:55,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912440794] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:45:55,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052975828] [2023-02-15 19:45:55,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:45:55,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:45:55,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:45:56,000 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 19:45:56,001 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 19:45:56,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:45:56,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:45:56,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 170 conjunts are in the unsatisfiable core [2023-02-15 19:45:56,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:45:56,255 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 19:45:56,348 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 19:45:56,657 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:45:56,658 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 21 [2023-02-15 19:45:56,669 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 19:45:56,748 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 13 treesize of output 9 [2023-02-15 19:45:56,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-15 19:45:56,760 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 19:45:56,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:56,771 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 16 treesize of output 17 [2023-02-15 19:45:56,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:56,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:56,894 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:45:56,896 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:45:56,896 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 1 case distinctions, treesize of input 80 treesize of output 55 [2023-02-15 19:45:56,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:56,902 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 20 treesize of output 22 [2023-02-15 19:45:56,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:56,908 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 19:45:57,247 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:45:57,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 45 [2023-02-15 19:45:57,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 19:45:57,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:57,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 19:45:57,258 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 19:45:57,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:57,449 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 19:45:57,449 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 83 treesize of output 81 [2023-02-15 19:45:57,461 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 19:45:57,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2023-02-15 19:45:57,468 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 19:45:57,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:57,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:57,480 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 19:45:57,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2023-02-15 19:45:57,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:57,502 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 19:45:57,502 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 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 19:45:58,312 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:45:58,400 INFO L321 Elim1Store]: treesize reduction 277, result has 14.8 percent of original size [2023-02-15 19:45:58,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 12 new quantified variables, introduced 20 case distinctions, treesize of input 329 treesize of output 152 [2023-02-15 19:45:58,420 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 19:45:58,420 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 1 case distinctions, treesize of input 27 treesize of output 41 [2023-02-15 19:45:58,456 INFO L321 Elim1Store]: treesize reduction 100, result has 20.0 percent of original size [2023-02-15 19:45:58,457 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 7 new quantified variables, introduced 10 case distinctions, treesize of input 205 treesize of output 193 [2023-02-15 19:45:58,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:58,474 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-02-15 19:45:58,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 97 [2023-02-15 19:45:58,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:58,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:58,490 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2023-02-15 19:45:58,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 107 [2023-02-15 19:45:58,500 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 7 treesize of output 3 [2023-02-15 19:45:58,518 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 45 treesize of output 29 [2023-02-15 19:45:58,732 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:45:58,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:58,773 INFO L321 Elim1Store]: treesize reduction 122, result has 24.7 percent of original size [2023-02-15 19:45:58,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 282 treesize of output 160 [2023-02-15 19:45:58,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:45:58,806 INFO L321 Elim1Store]: treesize reduction 17, result has 62.2 percent of original size [2023-02-15 19:45:58,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 113 treesize of output 106 [2023-02-15 19:45:59,056 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 19:45:59,102 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:45:59,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:46:04,259 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_19| Int) (v_ArrVal_2239 (Array Int Int)) (v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2242 (Array Int Int)) (v_ArrVal_2240 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| v_ArrVal_2253)) (.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| v_ArrVal_2254))) (let ((.cse0 (let ((.cse5 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (+ (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (select (select .cse1 (select (select .cse1 .cse5) .cse6)) (+ (select (select .cse4 .cse5) .cse6) 4))))) (let ((.cse2 (select .cse1 .cse0)) (.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_19| 4))) (or (= (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| v_ArrVal_2255) .cse0 v_ArrVal_2242) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| v_ArrVal_2240) (select (select (store (store .cse1 .cse0 (store .cse2 .cse3 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| v_ArrVal_2235) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse0 (store (select .cse4 .cse0) .cse3 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| v_ArrVal_2239) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28|))) (not (= (select .cse2 .cse3) 0))))))) is different from false [2023-02-15 19:46:04,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052975828] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:46:04,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:46:04,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 57 [2023-02-15 19:46:04,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344369826] [2023-02-15 19:46:04,262 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:46:04,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-02-15 19:46:04,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:46:04,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-02-15 19:46:04,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3778, Unknown=52, NotChecked=124, Total=4160 [2023-02-15 19:46:04,264 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 57 states, 55 states have (on average 1.309090909090909) internal successors, (72), 48 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:46:16,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:46:16,522 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2023-02-15 19:46:16,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-02-15 19:46:16,522 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 55 states have (on average 1.309090909090909) internal successors, (72), 48 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2023-02-15 19:46:16,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:46:16,523 INFO L225 Difference]: With dead ends: 101 [2023-02-15 19:46:16,523 INFO L226 Difference]: Without dead ends: 99 [2023-02-15 19:46:16,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2730 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=1029, Invalid=10909, Unknown=56, NotChecked=216, Total=12210 [2023-02-15 19:46:16,525 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 519 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-15 19:46:16,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 397 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-02-15 19:46:16,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-15 19:46:16,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 51. [2023-02-15 19:46:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 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 19:46:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2023-02-15 19:46:16,542 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 44 [2023-02-15 19:46:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:46:16,542 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2023-02-15 19:46:16,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 55 states have (on average 1.309090909090909) internal successors, (72), 48 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:46:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2023-02-15 19:46:16,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 19:46:16,543 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:46:16,543 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:46:16,566 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 19:46:16,764 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,SelfDestructingSolverStorable11 [2023-02-15 19:46:16,764 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:46:16,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:46:16,765 INFO L85 PathProgramCache]: Analyzing trace with hash -397769244, now seen corresponding path program 1 times [2023-02-15 19:46:16,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:46:16,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764869818] [2023-02-15 19:46:16,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:46:16,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:46:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:46:18,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:46:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:46:18,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:46:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:46:18,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:46:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:46:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:46:18,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:46:18,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764869818] [2023-02-15 19:46:18,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764869818] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:46:18,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436875006] [2023-02-15 19:46:18,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:46:18,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:46:18,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:46:18,489 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 19:46:18,490 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 19:46:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:46:18,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 143 conjunts are in the unsatisfiable core [2023-02-15 19:46:18,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:46:18,919 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 19:46:18,958 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 19:46:19,077 WARN L837 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.offset|) (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0))) (<= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from false [2023-02-15 19:46:19,079 WARN L859 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.offset|) (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0))) (<= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from true [2023-02-15 19:46:19,094 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from false [2023-02-15 19:46:19,096 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from true [2023-02-15 19:46:19,146 WARN L837 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from false [2023-02-15 19:46:19,148 WARN L859 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from true [2023-02-15 19:46:19,186 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_25| .cse0))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1)))) is different from false [2023-02-15 19:46:19,188 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_25| .cse0))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1)))) is different from true [2023-02-15 19:46:19,219 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)) (not (= 0 |c_node_create_~temp~0#1.base|)) (= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_25| .cse0))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1)))) is different from false [2023-02-15 19:46:19,221 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)) (not (= 0 |c_node_create_~temp~0#1.base|)) (= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_25| .cse0))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1)))) is different from true [2023-02-15 19:46:19,259 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (not (= 0 |c_node_create_#res#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_25| .cse0))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= |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 19:46:19,261 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (not (= 0 |c_node_create_#res#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_25| .cse0))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= |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 19:46:19,316 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_26| .cse0))) |v_#valid_BEFORE_CALL_26|))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (not (= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_25| .cse1))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from false [2023-02-15 19:46:19,319 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_26| .cse0))) |v_#valid_BEFORE_CALL_26|))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (not (= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_25| .cse1))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from true [2023-02-15 19:46:19,342 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 19:46:19,346 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 19:46:19,373 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= .cse0 0) (<= 0 .cse0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_25| .cse1))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse2 (select |v_#valid_BEFORE_CALL_26| .cse2))) |v_#valid_BEFORE_CALL_26|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 19:46:19,376 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= .cse0 0) (<= 0 .cse0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_25| .cse1))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse2 (select |v_#valid_BEFORE_CALL_26| .cse2))) |v_#valid_BEFORE_CALL_26|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-15 19:46:19,396 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:46:19,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2023-02-15 19:46:19,419 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 19:46:19,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 41 [2023-02-15 19:46:19,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 19:46:19,452 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_26| .cse0))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_26| .cse1) 1))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (and (<= .cse2 0) (<= 0 .cse2)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_25| .cse4))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 19:46:19,455 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_26| .cse0))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_26| .cse1) 1))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (and (<= .cse2 0) (<= 0 .cse2)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_25| .cse4))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-15 19:46:19,502 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_26| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_26| .cse1))) |v_#valid_BEFORE_CALL_26|))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_25| .cse2))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (or (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (<= 0 .cse3) (<= .cse3 0)))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2023-02-15 19:46:19,505 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_26| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_26| .cse1))) |v_#valid_BEFORE_CALL_26|))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_25| .cse2))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (or (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (<= 0 .cse3) (<= .cse3 0)))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from true [2023-02-15 19:46:19,611 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_26| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_26| .cse1))) |v_#valid_BEFORE_CALL_26|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_25| .cse2))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (not (= 0 |c_ULTIMATE.start_dll_create_#res#1.base|)) (or (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (<= 0 .cse3) (<= .cse3 0))) (= |c_ULTIMATE.start_dll_create_#res#1.base| .cse0)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2023-02-15 19:46:19,614 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_26| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_26| .cse1))) |v_#valid_BEFORE_CALL_26|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_25| .cse2))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (not (= 0 |c_ULTIMATE.start_dll_create_#res#1.base|)) (or (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (<= 0 .cse3) (<= .cse3 0))) (= |c_ULTIMATE.start_dll_create_#res#1.base| .cse0)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from true [2023-02-15 19:46:19,665 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 ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse2 (select |v_#valid_BEFORE_CALL_26| .cse2))) |v_#valid_BEFORE_CALL_26|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| .cse0 1)) (= (select |v_#valid_BEFORE_CALL_26| .cse1) 1))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_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) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (not (= 0 .cse0)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (and (<= .cse4 0) (<= 0 .cse4))) (= .cse0 .cse1))))) is different from false [2023-02-15 19:46:19,668 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 ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse2 (select |v_#valid_BEFORE_CALL_26| .cse2))) |v_#valid_BEFORE_CALL_26|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| .cse0 1)) (= (select |v_#valid_BEFORE_CALL_26| .cse1) 1))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_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) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (not (= 0 .cse0)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse0) 4))) (and (<= .cse4 0) (<= 0 .cse4))) (= .cse0 .cse1))))) is different from true [2023-02-15 19:46:19,686 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:46:19,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 42 [2023-02-15 19:46:19,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:46:19,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-02-15 19:46:19,735 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_209) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_26| v_arrayElimIndex_54)) (not (= 0 v_arrayElimIndex_54)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_26| .cse0))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| v_arrayElimCell_209) 1))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_25| .cse1))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1)))) is different from false [2023-02-15 19:46:19,738 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_209) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_26| v_arrayElimIndex_54)) (not (= 0 v_arrayElimIndex_54)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_26| .cse0))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| v_arrayElimCell_209) 1))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_25| .cse1))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1)))) is different from true [2023-02-15 19:46:19,782 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)|) (not (= 0 |c_node_create_~temp~0#1.base|)) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_209) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_26| v_arrayElimIndex_54)) (not (= 0 v_arrayElimIndex_54)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_26| .cse0))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| v_arrayElimCell_209) 1))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_25| .cse1))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from false [2023-02-15 19:46:19,785 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)|) (not (= 0 |c_node_create_~temp~0#1.base|)) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_209) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_26| v_arrayElimIndex_54)) (not (= 0 v_arrayElimIndex_54)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_26| .cse0))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| v_arrayElimCell_209) 1))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_25| .cse1))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2023-02-15 19:46:19,869 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2502 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2502))) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (not (= 0 |c_node_create_#res#1.base|)) (exists ((v_ArrVal_2503 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2503))) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_209) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_26| v_arrayElimIndex_54)) (not (= 0 v_arrayElimIndex_54)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_26| .cse0))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| v_arrayElimCell_209) 1))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_25| .cse1))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= 0 (select |c_old(#valid)| |c_node_create_#res#1.base|))) is different from false [2023-02-15 19:46:19,873 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2502 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2502))) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (not (= 0 |c_node_create_#res#1.base|)) (exists ((v_ArrVal_2503 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2503))) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_209) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_26| v_arrayElimIndex_54)) (not (= 0 v_arrayElimIndex_54)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_26| .cse0))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| v_arrayElimCell_209) 1))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_25| .cse1))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= 0 (select |c_old(#valid)| |c_node_create_#res#1.base|))) is different from true [2023-02-15 19:46:19,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:46:19,939 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:46:19,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 85 [2023-02-15 19:46:19,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:46:19,953 INFO L321 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2023-02-15 19:46:19,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 60 [2023-02-15 19:46:20,059 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_25| .cse0))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (not (= 0 v_arrayElimIndex_54)) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_31| .cse2))) |v_#valid_BEFORE_CALL_31|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 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 (= 0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (not (= 0 .cse3)) (or (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= .cse4 0) (<= 0 .cse4))) (= .cse3 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) (= .cse3 .cse5)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse3)) (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse3 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse6 (select |v_#valid_BEFORE_CALL_26| .cse6))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse5) 1))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 19:46:20,063 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_25| .cse0))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (not (= 0 v_arrayElimIndex_54)) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_31| .cse2))) |v_#valid_BEFORE_CALL_31|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 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 (= 0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (not (= 0 .cse3)) (or (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= .cse4 0) (<= 0 .cse4))) (= .cse3 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) (= .cse3 .cse5)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse3)) (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse3 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse6 (select |v_#valid_BEFORE_CALL_26| .cse6))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse5) 1))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-15 19:46:20,244 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_31| .cse1))) |v_#valid_BEFORE_CALL_31|))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_25| .cse2))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse3 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse3)) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse5 (select |v_#valid_BEFORE_CALL_26| .cse5))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse4) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= 0 .cse3)) (or (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= .cse6 0) (<= 0 .cse6))) (= .cse3 .cse4)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 19:46:20,248 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_31| .cse1))) |v_#valid_BEFORE_CALL_31|))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_25| .cse2))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse3 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse3)) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse5 (select |v_#valid_BEFORE_CALL_26| .cse5))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse4) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= 0 .cse3)) (or (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= .cse6 0) (<= 0 .cse6))) (= .cse3 .cse4)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-15 19:46:20,389 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_31| .cse2))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse4 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse4)) (= (select |v_#valid_BEFORE_CALL_27| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse6 (select |v_#valid_BEFORE_CALL_26| .cse6))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse5) 1))) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= .cse0 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (not (= 0 .cse4)) (or (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (and (<= .cse7 0) (<= 0 .cse7))) (= .cse4 .cse5)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 19:46:20,393 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_31| .cse2))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse4 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse4)) (= (select |v_#valid_BEFORE_CALL_27| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse6 (select |v_#valid_BEFORE_CALL_26| .cse6))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse5) 1))) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= .cse0 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (not (= 0 .cse4)) (or (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (and (<= .cse7 0) (<= 0 .cse7))) (= .cse4 .cse5)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-15 19:46:20,534 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_31| .cse2))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse4 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse4)) (= (select |v_#valid_BEFORE_CALL_27| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse6 (select |v_#valid_BEFORE_CALL_26| .cse6))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse5) 1))) (= .cse0 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (not (= 0 .cse4)) (or (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (and (<= .cse7 0) (<= 0 .cse7))) (= .cse4 .cse5)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 19:46:20,538 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse0) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_31| .cse2))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse4 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse4)) (= (select |v_#valid_BEFORE_CALL_27| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse6 (select |v_#valid_BEFORE_CALL_26| .cse6))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse5) 1))) (= .cse0 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (not (= 0 .cse4)) (or (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| .cse4) 4))) (and (<= .cse7 0) (<= 0 .cse7))) (= .cse4 .cse5)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-15 19:46:20,662 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 ((.cse1 (select |c_#memory_$Pointer$.base| .cse6)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse2 (+ .cse9 4)) (.cse5 (select |c_#memory_$Pointer$.offset| .cse6)) (.cse7 (select .cse1 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse1 .cse2)) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_25| .cse4))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse5 .cse2)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse6 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse6)) (= (select |v_#valid_BEFORE_CALL_27| .cse7) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse8 (select |v_#valid_BEFORE_CALL_26| .cse8))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse7) 1))) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= .cse9 0) (not (= 0 .cse6)) (or (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (let ((.cse10 (select .cse5 4))) (and (<= .cse10 0) (<= 0 .cse10))) (= .cse6 .cse7)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 19:46:20,666 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 ((.cse1 (select |c_#memory_$Pointer$.base| .cse6)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse2 (+ .cse9 4)) (.cse5 (select |c_#memory_$Pointer$.offset| .cse6)) (.cse7 (select .cse1 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse1 .cse2)) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_25| .cse4))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse5 .cse2)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse6 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse6)) (= (select |v_#valid_BEFORE_CALL_27| .cse7) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse8 (select |v_#valid_BEFORE_CALL_26| .cse8))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse7) 1))) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= .cse9 0) (not (= 0 .cse6)) (or (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (let ((.cse10 (select .cse5 4))) (and (<= .cse10 0) (<= 0 .cse10))) (= .cse6 .cse7)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from true [2023-02-15 19:46:20,809 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 ((.cse1 (select |c_#memory_$Pointer$.base| .cse6)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse2 (+ .cse9 4)) (.cse5 (select |c_#memory_$Pointer$.offset| .cse6)) (.cse7 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse1 .cse2)) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_25| .cse4))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse5 .cse2)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse6 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse6)) (= (select |v_#valid_BEFORE_CALL_27| .cse7) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse8 (select |v_#valid_BEFORE_CALL_26| .cse8))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse7) 1))) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= .cse9 0) (not (= 0 .cse6)) (or (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (let ((.cse10 (select .cse5 4))) (and (<= .cse10 0) (<= 0 .cse10))) (= .cse6 .cse7)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 19:46:20,814 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 ((.cse1 (select |c_#memory_$Pointer$.base| .cse6)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse2 (+ .cse9 4)) (.cse5 (select |c_#memory_$Pointer$.offset| .cse6)) (.cse7 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse1 .cse2)) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_25| .cse4))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse5 .cse2)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse6 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse6)) (= (select |v_#valid_BEFORE_CALL_27| .cse7) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse8 (select |v_#valid_BEFORE_CALL_26| .cse8))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse7) 1))) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= .cse9 0) (not (= 0 .cse6)) (or (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (let ((.cse10 (select .cse5 4))) (and (<= .cse10 0) (<= 0 .cse10))) (= .cse6 .cse7)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from true [2023-02-15 19:46:20,988 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 ((.cse1 (select |c_#memory_$Pointer$.base| .cse6)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse2 (+ .cse9 4)) (.cse5 (select |c_#memory_$Pointer$.offset| .cse6)) (.cse7 (select .cse1 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse1 .cse2)) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_25| .cse4))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse5 .cse2)) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse6 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse6)) (= (select |v_#valid_BEFORE_CALL_27| .cse7) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse8 (select |v_#valid_BEFORE_CALL_26| .cse8))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse7) 1))) (= .cse9 0) (not (= 0 .cse6)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (or (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (let ((.cse10 (select .cse5 4))) (and (<= .cse10 0) (<= 0 .cse10))) (= .cse6 .cse7)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 19:46:20,992 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 ((.cse1 (select |c_#memory_$Pointer$.base| .cse6)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse2 (+ .cse9 4)) (.cse5 (select |c_#memory_$Pointer$.offset| .cse6)) (.cse7 (select .cse1 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse1 .cse2)) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_25| .cse4))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse5 .cse2)) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse6 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse6)) (= (select |v_#valid_BEFORE_CALL_27| .cse7) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse8 (select |v_#valid_BEFORE_CALL_26| .cse8))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse7) 1))) (= .cse9 0) (not (= 0 .cse6)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (or (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (let ((.cse10 (select .cse5 4))) (and (<= .cse10 0) (<= 0 .cse10))) (= .cse6 .cse7)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from true [2023-02-15 19:46:21,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:46:21,023 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:46:21,060 INFO L321 Elim1Store]: treesize reduction 145, result has 11.0 percent of original size [2023-02-15 19:46:21,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 255 treesize of output 130 [2023-02-15 19:46:21,104 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-15 19:46:21,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 397 treesize of output 282 [2023-02-15 19:46:21,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:46:21,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:46:21,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:46:21,122 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:46:21,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 327 treesize of output 223 [2023-02-15 19:46:21,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:46:21,155 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 19:46:21,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 287 treesize of output 233 [2023-02-15 19:46:21,247 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse7) (+ (select .cse6 (+ .cse3 4)) 4)))) (let ((.cse2 (+ .cse0 2))) (and (not (= 0 .cse0)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_25| .cse1))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= .cse3 0) (or (= .cse4 .cse0) (let ((.cse5 (select .cse6 4))) (and (<= .cse5 0) (<= 0 .cse5))) (= .cse4 .cse7)) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (<= .cse2 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_31| .cse8))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse4)) (= (select |v_#valid_BEFORE_CALL_27| .cse7) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse9 (select |v_#valid_BEFORE_CALL_26| .cse9))) |v_#valid_BEFORE_CALL_26|) (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse4 1) .cse0)) (= (select |v_#valid_BEFORE_CALL_26| .cse7) 1))) (not (= 0 .cse4)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-02-15 19:46:21,251 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse7) (+ (select .cse6 (+ .cse3 4)) 4)))) (let ((.cse2 (+ .cse0 2))) (and (not (= 0 .cse0)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_25| .cse1))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= .cse3 0) (or (= .cse4 .cse0) (let ((.cse5 (select .cse6 4))) (and (<= .cse5 0) (<= 0 .cse5))) (= .cse4 .cse7)) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (<= .cse2 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_31| .cse8))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse4)) (= (select |v_#valid_BEFORE_CALL_27| .cse7) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse9 (select |v_#valid_BEFORE_CALL_26| .cse9))) |v_#valid_BEFORE_CALL_26|) (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse4 1) .cse0)) (= (select |v_#valid_BEFORE_CALL_26| .cse7) 1))) (not (= 0 .cse4)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from true [2023-02-15 19:46:21,612 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse9 (select |c_#memory_$Pointer$.offset| .cse3)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse7) (+ (select .cse9 (+ .cse1 4)) 4)))) (let ((.cse0 (+ .cse5 2)) (.cse6 (select .cse9 4))) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= .cse1 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_31| .cse2))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse3)) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse4 (select |v_#valid_BEFORE_CALL_26| .cse4))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_27| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse3 1) .cse5)) (<= 0 .cse6) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse6 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (not (= 0 .cse5)) (= (select |v_#valid_BEFORE_CALL_27| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_26| .cse7) 1) (not (= 0 .cse3)) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse8 (select |v_#valid_BEFORE_CALL_25| .cse8))) |v_#valid_BEFORE_CALL_25|) (not (= 0 v_arrayElimIndex_54)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3))))))) is different from false [2023-02-15 19:46:21,818 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse9 (select |c_#memory_$Pointer$.offset| .cse3)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse7) (+ (select .cse9 (+ .cse1 4)) 4)))) (let ((.cse0 (+ .cse5 2)) (.cse6 (select .cse9 4))) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= .cse1 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_31| .cse2))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse3)) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse4 (select |v_#valid_BEFORE_CALL_26| .cse4))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_27| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse3 1) .cse5)) (<= 0 .cse6) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse6 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (not (= 0 .cse5)) (= (select |v_#valid_BEFORE_CALL_27| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_26| .cse7) 1) (not (= 0 .cse3)) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse8 (select |v_#valid_BEFORE_CALL_25| .cse8))) |v_#valid_BEFORE_CALL_25|) (not (= 0 v_arrayElimIndex_54)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3))))))) is different from true [2023-02-15 19:46:21,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:46:21,972 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 19:46:21,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 135 [2023-02-15 19:46:22,113 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse4) (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (let ((.cse2 (+ .cse1 2))) (and (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse0 1) .cse1)) (<= .cse2 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (not (= 0 .cse1)) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3))) |v_#valid_BEFORE_CALL_31|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse0)) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (not (= 0 .cse0)) (= (select |v_#valid_BEFORE_CALL_26| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse5 (select |v_#valid_BEFORE_CALL_25| .cse5))) |v_#valid_BEFORE_CALL_25|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 v_arrayElimIndex_54)) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse6 (select |v_#valid_BEFORE_CALL_26| .cse6))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_27| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))))))) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0)) is different from false [2023-02-15 19:46:22,117 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse4) (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (let ((.cse2 (+ .cse1 2))) (and (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse0 1) .cse1)) (<= .cse2 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (not (= 0 .cse1)) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3))) |v_#valid_BEFORE_CALL_31|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse0)) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (not (= 0 .cse0)) (= (select |v_#valid_BEFORE_CALL_26| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse5 (select |v_#valid_BEFORE_CALL_25| .cse5))) |v_#valid_BEFORE_CALL_25|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 v_arrayElimIndex_54)) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse6 (select |v_#valid_BEFORE_CALL_26| .cse6))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_27| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))))))) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0)) is different from true [2023-02-15 19:46:22,223 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:46:22,226 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:46:22,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 56 [2023-02-15 19:46:22,306 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_25| .cse0))) |v_#valid_BEFORE_CALL_25|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (not (= 0 v_arrayElimIndex_54)) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_31| .cse2))) |v_#valid_BEFORE_CALL_31|))) (not (= 0 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (v_arrayElimIndex_67 Int) (v_arrayElimIndex_66 Int)) (and (= (select |v_#valid_BEFORE_CALL_26| v_arrayElimIndex_67) 1) (not (= 0 v_arrayElimIndex_66)) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimIndex_67) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_26| v_arrayElimIndex_66 1) |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse3 (select |v_#valid_BEFORE_CALL_26| .cse3))) |v_#valid_BEFORE_CALL_26|) (= 0 (select |v_#valid_BEFORE_CALL_26| v_arrayElimIndex_66)))))) is different from false [2023-02-15 19:46:22,311 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_25| .cse0))) |v_#valid_BEFORE_CALL_25|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (not (= 0 v_arrayElimIndex_54)) (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_31| .cse2))) |v_#valid_BEFORE_CALL_31|))) (not (= 0 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (exists ((|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (v_arrayElimIndex_67 Int) (v_arrayElimIndex_66 Int)) (and (= (select |v_#valid_BEFORE_CALL_26| v_arrayElimIndex_67) 1) (not (= 0 v_arrayElimIndex_66)) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimIndex_67) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_26| v_arrayElimIndex_66 1) |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse3 (select |v_#valid_BEFORE_CALL_26| .cse3))) |v_#valid_BEFORE_CALL_26|) (= 0 (select |v_#valid_BEFORE_CALL_26| v_arrayElimIndex_66)))))) is different from true [2023-02-15 19:46:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2023-02-15 19:46:22,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:46:23,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436875006] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:46:23,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:46:23,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32] total 58 [2023-02-15 19:46:23,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559792096] [2023-02-15 19:46:23,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:46:23,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-02-15 19:46:23,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:46:23,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-02-15 19:46:23,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1616, Unknown=55, NotChecked=2730, Total=4556 [2023-02-15 19:46:23,312 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 58 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 48 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:46:23,591 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|))) (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= .cse0 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)) (<= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.offset|) (= 1 .cse0) (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (<= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2023-02-15 19:46:23,593 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|))) (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= .cse0 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)) (<= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.offset|) (= 1 .cse0) (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (<= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from true [2023-02-15 19:46:23,596 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= 1 .cse1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2023-02-15 19:46:23,597 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= 1 .cse1) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from true [2023-02-15 19:46:23,600 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 1) (= 1 .cse0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2023-02-15 19:46:23,601 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 1) (= 1 .cse0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_24| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |c_#valid|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |c_#valid| .cse1))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_24| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from true [2023-02-15 19:46:23,605 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#length| |c_old(#length)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_25| .cse0))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= |c_#memory_int| |c_old(#memory_int)|)) is different from false [2023-02-15 19:46:23,606 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#length| |c_old(#length)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse0 (select |v_#valid_BEFORE_CALL_25| .cse0))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= |c_#memory_int| |c_old(#memory_int)|)) is different from true [2023-02-15 19:46:23,610 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (= 0 .cse0) (= |c_old(#memory_$Pointer$.offset)| |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|) (= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_25| .cse1))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|) (= .cse2 1) (<= |c_node_create_~temp~0#1.offset| 0) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse2) |c_#valid|) (= .cse0 0) (not (= 0 |c_node_create_~temp~0#1.base|)) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from false [2023-02-15 19:46:23,612 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (= 0 .cse0) (= |c_old(#memory_$Pointer$.offset)| |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|) (= 0 |c_node_create_~temp~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_25| .cse1))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|) (= .cse2 1) (<= |c_node_create_~temp~0#1.offset| 0) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse2) |c_#valid|) (= .cse0 0) (not (= 0 |c_node_create_~temp~0#1.base|)) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2023-02-15 19:46:23,623 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse4 (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse5 (select |c_old(#valid)| |c_node_create_#res#1.base|))) (and (or .cse0 (= (select |c_old(#valid)| .cse1) 0)) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_node_create_#res#1.offset| 0) (= (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2)) |c_#memory_$Pointer$.base|) (or .cse0 (<= (+ .cse1 1) |c_#StackHeapBarrier|)) (= (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1)) |c_#memory_$Pointer$.offset|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (or .cse4 (= (select |c_old(#valid)| .cse2) 0)) (= 0 .cse5) (or (<= (+ .cse2 1) |c_#StackHeapBarrier|) .cse4) (<= |c_node_create_#res#1.offset| 0) (<= 0 |c_node_create_#res#1.offset|) (not (= 0 |c_node_create_#res#1.base|)) (= .cse5 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6))) |c_#valid|))) is different from false [2023-02-15 19:46:23,627 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse4 (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse5 (select |c_old(#valid)| |c_node_create_#res#1.base|))) (and (or .cse0 (= (select |c_old(#valid)| .cse1) 0)) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_node_create_#res#1.offset| 0) (= (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2)) |c_#memory_$Pointer$.base|) (or .cse0 (<= (+ .cse1 1) |c_#StackHeapBarrier|)) (= (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1)) |c_#memory_$Pointer$.offset|) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (or .cse4 (= (select |c_old(#valid)| .cse2) 0)) (= 0 .cse5) (or (<= (+ .cse2 1) |c_#StackHeapBarrier|) .cse4) (<= |c_node_create_#res#1.offset| 0) (<= 0 |c_node_create_#res#1.offset|) (not (= 0 |c_node_create_#res#1.base|)) (= .cse5 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6))) |c_#valid|))) is different from true [2023-02-15 19:46:23,637 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_26| .cse0))) |v_#valid_BEFORE_CALL_26|))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (not (= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_25| .cse1))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) is different from false [2023-02-15 19:46:23,639 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 1)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_26| .cse0))) |v_#valid_BEFORE_CALL_26|))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (not (= 0 |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_25| .cse1))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) is different from true [2023-02-15 19:46:23,649 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (and (<= 0 .cse0) (= 1 (select |c_#valid| .cse1)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_25| .cse2))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= .cse0 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 0) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse1)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse3 (select |v_#valid_BEFORE_CALL_26| .cse3))) |v_#valid_BEFORE_CALL_26|))) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) is different from false [2023-02-15 19:46:23,652 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (and (<= 0 .cse0) (= 1 (select |c_#valid| .cse1)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_25| .cse2))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= .cse0 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 0) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse1)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse3 (select |v_#valid_BEFORE_CALL_26| .cse3))) |v_#valid_BEFORE_CALL_26|))) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) is different from true [2023-02-15 19:46:23,662 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (let ((.cse3 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (and (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_26| .cse0))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_26| .cse1) 1))) (= 1 (select |c_#valid| .cse1)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_25| .cse2))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (not .cse3) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (or .cse3 (and (<= .cse4 0) (<= 0 .cse4))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse1)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) is different from false [2023-02-15 19:46:23,665 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (let ((.cse3 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (and (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_26| .cse0))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_26| .cse1) 1))) (= 1 (select |c_#valid| .cse1)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_25| .cse2))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (not .cse3) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse4 0) (or .cse3 (and (<= .cse4 0) (<= 0 .cse4))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse1)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) is different from true [2023-02-15 19:46:23,675 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse4 (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1))) (and (= .cse0 0) (= 1 (select |c_#valid| .cse1)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| .cse1) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_26| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse2 (select |v_#valid_BEFORE_CALL_26| .cse2))) |v_#valid_BEFORE_CALL_26|))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (or .cse4 (and (<= 0 .cse0) (<= .cse0 0))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not .cse4) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)))) is different from false [2023-02-15 19:46:23,679 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse4 (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1))) (and (= .cse0 0) (= 1 (select |c_#valid| .cse1)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| .cse1) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_26| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse2 (select |v_#valid_BEFORE_CALL_26| .cse2))) |v_#valid_BEFORE_CALL_26|))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (or .cse4 (and (<= 0 .cse0) (<= .cse0 0))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not .cse4) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)))) is different from true [2023-02-15 19:46:23,689 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) (.cse1 (= |c_ULTIMATE.start_dll_create_#res#1.base| .cse3))) (and (= .cse0 0) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (not .cse1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_25| .cse2))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (not (= 0 |c_ULTIMATE.start_dll_create_#res#1.base|)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_26| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse4 (select |v_#valid_BEFORE_CALL_26| .cse4))) |v_#valid_BEFORE_CALL_26|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| .cse3) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse3)) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|)) (or (and (<= 0 .cse0) (<= .cse0 0)) .cse1) (= 1 (select |c_#valid| .cse3))))) is different from false [2023-02-15 19:46:23,692 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) (.cse1 (= |c_ULTIMATE.start_dll_create_#res#1.base| .cse3))) (and (= .cse0 0) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (not .cse1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_25| .cse2))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (not (= 0 |c_ULTIMATE.start_dll_create_#res#1.base|)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_26| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse4 (select |v_#valid_BEFORE_CALL_26| .cse4))) |v_#valid_BEFORE_CALL_26|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (= 0 (select |v_#valid_BEFORE_CALL_26| |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| .cse3) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse3)) (= 1 (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|)) (or (and (<= 0 .cse0) (<= .cse0 0)) .cse1) (= 1 (select |c_#valid| .cse3))))) is different from true [2023-02-15 19:46:23,704 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (let ((.cse0 (= .cse1 .cse2)) (.cse5 (select (select |c_#memory_$Pointer$.offset| .cse1) 4))) (and (not .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse1)) (= (select |v_#valid_BEFORE_CALL_27| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse3 (select |v_#valid_BEFORE_CALL_26| .cse3))) |v_#valid_BEFORE_CALL_26|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| .cse1 1)) (= (select |v_#valid_BEFORE_CALL_26| .cse2) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~head#1.base| .cse2)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_25| .cse4))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (not (= 0 .cse1)) (= 1 (select |c_#valid| .cse2)) (or (and (<= .cse5 0) (<= 0 .cse5)) .cse0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= 1 (select |c_#valid| .cse1)) (= .cse5 0))))) is different from false [2023-02-15 19:46:23,707 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (let ((.cse0 (= .cse1 .cse2)) (.cse5 (select (select |c_#memory_$Pointer$.offset| .cse1) 4))) (and (not .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse1)) (= (select |v_#valid_BEFORE_CALL_27| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse3 (select |v_#valid_BEFORE_CALL_26| .cse3))) |v_#valid_BEFORE_CALL_26|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_26| .cse1 1)) (= (select |v_#valid_BEFORE_CALL_26| .cse2) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~head#1.base| .cse2)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_25| .cse4))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (not (= 0 .cse1)) (= 1 (select |c_#valid| .cse2)) (or (and (<= .cse5 0) (<= 0 .cse5)) .cse0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= 1 (select |c_#valid| .cse1)) (= .cse5 0))))) is different from true [2023-02-15 19:46:23,718 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#length| |c_old(#length)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_209) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_26| v_arrayElimIndex_54)) (not (= 0 v_arrayElimIndex_54)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_26| .cse0))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| v_arrayElimCell_209) 1))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_25| .cse1))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= |c_#memory_int| |c_old(#memory_int)|)) is different from false [2023-02-15 19:46:23,721 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#length| |c_old(#length)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_209) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_26| v_arrayElimIndex_54)) (not (= 0 v_arrayElimIndex_54)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |v_#valid_BEFORE_CALL_26| .cse0))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| v_arrayElimCell_209) 1))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse1 (select |v_#valid_BEFORE_CALL_25| .cse1))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= |c_#memory_int| |c_old(#memory_int)|)) is different from true [2023-02-15 19:46:23,731 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (= 0 .cse0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_209) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_26| v_arrayElimIndex_54)) (not (= 0 v_arrayElimIndex_54)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_26| .cse1))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| v_arrayElimCell_209) 1))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_25| .cse2))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|) (= .cse3 1) (<= |c_node_create_~temp~0#1.offset| 0) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse3) |c_#valid|) (= .cse0 0) (not (= 0 |c_node_create_~temp~0#1.base|)) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from false [2023-02-15 19:46:23,734 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#valid| |c_node_create_~temp~0#1.base|)) (.cse0 (select |c_old(#valid)| |c_node_create_~temp~0#1.base|))) (and (= 0 .cse0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (<= 0 |c_node_create_~temp~0#1.offset|) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_209) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_26| v_arrayElimIndex_54)) (not (= 0 v_arrayElimIndex_54)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_26| .cse1))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| v_arrayElimCell_209) 1))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_25| .cse2))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|) (= .cse3 1) (<= |c_node_create_~temp~0#1.offset| 0) (= (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse3) |c_#valid|) (= .cse0 0) (not (= 0 |c_node_create_~temp~0#1.base|)) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2023-02-15 19:46:23,833 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse5 (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse6 (select |c_old(#valid)| |c_node_create_#res#1.base|))) (and (or .cse0 (= (select |c_old(#valid)| .cse1) 0)) (exists ((v_ArrVal_2502 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2502))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2)) |c_#memory_$Pointer$.base|) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (or .cse0 (<= (+ .cse1 1) |c_#StackHeapBarrier|)) (= (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1)) |c_#memory_$Pointer$.offset|) (exists ((v_ArrVal_2503 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2503))) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_209) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_26| v_arrayElimIndex_54)) (not (= 0 v_arrayElimIndex_54)) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse3 (select |v_#valid_BEFORE_CALL_26| .cse3))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| v_arrayElimCell_209) 1))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_25| .cse4))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (or .cse5 (= (select |c_old(#valid)| .cse2) 0)) (= 0 .cse6) (or (<= (+ .cse2 1) |c_#StackHeapBarrier|) .cse5) (<= |c_node_create_#res#1.offset| 0) (<= 0 |c_node_create_#res#1.offset|) (not (= 0 |c_node_create_#res#1.base|)) (= .cse6 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (let ((.cse7 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse7 (select |c_#valid| .cse7))) |c_#valid|))) is different from false [2023-02-15 19:46:23,839 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse5 (= |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse6 (select |c_old(#valid)| |c_node_create_#res#1.base|))) (and (or .cse0 (= (select |c_old(#valid)| .cse1) 0)) (exists ((v_ArrVal_2502 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2502))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2)) |c_#memory_$Pointer$.base|) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (or .cse0 (<= (+ .cse1 1) |c_#StackHeapBarrier|)) (= (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1)) |c_#memory_$Pointer$.offset|) (exists ((v_ArrVal_2503 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2503))) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_209) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_26| v_arrayElimIndex_54)) (not (= 0 v_arrayElimIndex_54)) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse3 (select |v_#valid_BEFORE_CALL_26| .cse3))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| v_arrayElimCell_209) 1))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_25| .cse4))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (or .cse5 (= (select |c_old(#valid)| .cse2) 0)) (= 0 .cse6) (or (<= (+ .cse2 1) |c_#StackHeapBarrier|) .cse5) (<= |c_node_create_#res#1.offset| 0) (<= 0 |c_node_create_#res#1.offset|) (not (= 0 |c_node_create_#res#1.base|)) (= .cse6 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (let ((.cse7 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse7 (select |c_#valid| .cse7))) |c_#valid|))) is different from true [2023-02-15 19:46:23,889 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse0 (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (not (= .cse2 |c_ULTIMATE.start_dll_append_#t~ret7#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) (not (= 0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (not (= 0 .cse3)) (not (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse3)) (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse3 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse5 (select |v_#valid_BEFORE_CALL_26| .cse5))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse4) 1))) (or (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= .cse6 0) (<= 0 .cse6))) (= .cse3 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) (= .cse3 .cse4)) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (not (= |c_ULTIMATE.start_dll_append_~head#1.base| .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse2 .cse1)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse7 (select |v_#valid_BEFORE_CALL_25| .cse7))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (not (= 0 v_arrayElimIndex_54)) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_31| .cse8))) |v_#valid_BEFORE_CALL_31|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1)))))) is different from false [2023-02-15 19:46:23,893 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse0 (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (not (= .cse2 |c_ULTIMATE.start_dll_append_#t~ret7#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) (not (= 0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (not (= 0 .cse3)) (not (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse3)) (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse3 1) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse5 (select |v_#valid_BEFORE_CALL_26| .cse5))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse4) 1))) (or (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| .cse3) 4))) (and (<= .cse6 0) (<= 0 .cse6))) (= .cse3 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) (= .cse3 .cse4)) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (not (= |c_ULTIMATE.start_dll_append_~head#1.base| .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse2 .cse1)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse7 (select |v_#valid_BEFORE_CALL_25| .cse7))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (not (= 0 v_arrayElimIndex_54)) (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_31| .cse8))) |v_#valid_BEFORE_CALL_31|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1)))))) is different from true [2023-02-15 19:46:23,958 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|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (not (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse2 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_25| .cse4))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~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) (not (= 0 .cse5)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (not (= |c_ULTIMATE.start_dll_append_~head#1.base| .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse0 .cse1)) (not (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_append_#t~mem8#1.base|) (= |c_ULTIMATE.start_dll_append_#t~mem8#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse5)) (= (select |v_#valid_BEFORE_CALL_27| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse7 (select |v_#valid_BEFORE_CALL_26| .cse7))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse6) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_append_~head#1.offset|) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (let ((.cse8 (select (select |c_#memory_$Pointer$.offset| .cse5) 4))) (and (<= .cse8 0) (<= 0 .cse8))) (= .cse5 .cse6))))) is different from false [2023-02-15 19:46:23,962 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|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (not (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse2 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse4 (select |v_#valid_BEFORE_CALL_25| .cse4))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~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) (not (= 0 .cse5)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (not (= |c_ULTIMATE.start_dll_append_~head#1.base| .cse1)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse0 .cse1)) (not (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_append_#t~mem8#1.base|) (= |c_ULTIMATE.start_dll_append_#t~mem8#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse5)) (= (select |v_#valid_BEFORE_CALL_27| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse7 (select |v_#valid_BEFORE_CALL_26| .cse7))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse6) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_append_~head#1.offset|) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (let ((.cse8 (select (select |c_#memory_$Pointer$.offset| .cse5) 4))) (and (<= .cse8 0) (<= 0 .cse8))) (= .cse5 .cse6))))) is different from true [2023-02-15 19:46:24,010 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_31| .cse2))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1)) (= .cse4 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) (not (= 0 .cse5)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse4) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6) 0) (= 0 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse5)) (= (select |v_#valid_BEFORE_CALL_27| .cse7) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse8 (select |v_#valid_BEFORE_CALL_26| .cse8))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse7) 1))) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| .cse5) 4))) (and (<= .cse9 0) (<= 0 .cse9))) (= .cse5 .cse7)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse1))))) is different from false [2023-02-15 19:46:24,014 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_31| .cse2))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1)) (= .cse4 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) (not (= 0 .cse5)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse4) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6) 0) (= 0 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse5)) (= (select |v_#valid_BEFORE_CALL_27| .cse7) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse8 (select |v_#valid_BEFORE_CALL_26| .cse8))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse7) 1))) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| .cse5) 4))) (and (<= .cse9 0) (<= 0 .cse9))) (= .cse5 .cse7)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse1))))) is different from true [2023-02-15 19:46:24,062 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_31| .cse2))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1)) (= .cse4 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) (not (= 0 .cse5)) (= 0 |c_ULTIMATE.start_dll_append_#t~mem11#1.offset|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse4) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6) 0) (= 0 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse5)) (= (select |v_#valid_BEFORE_CALL_27| .cse7) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse8 (select |v_#valid_BEFORE_CALL_26| .cse8))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse7) 1))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| .cse5) 4))) (and (<= .cse9 0) (<= 0 .cse9))) (= .cse5 .cse7)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse1))))) is different from false [2023-02-15 19:46:24,067 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_31| .cse2))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1)) (= .cse4 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) (not (= 0 .cse5)) (= 0 |c_ULTIMATE.start_dll_append_#t~mem11#1.offset|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse4) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6) 0) (= 0 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse5)) (= (select |v_#valid_BEFORE_CALL_27| .cse7) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse8 (select |v_#valid_BEFORE_CALL_26| .cse8))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse7) 1))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| .cse5) 4))) (and (<= .cse9 0) (<= 0 .cse9))) (= .cse5 .cse7)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse1))))) is different from true [2023-02-15 19:46:24,127 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 ((.cse9 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse7 (select |c_#memory_$Pointer$.base| .cse5)) (.cse12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse4 (= .cse12 0)) (.cse8 (+ .cse12 4)) (.cse3 (select .cse7 4)) (.cse11 (select .cse9 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_31| .cse1))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_25| .cse2))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) .cse4 (not (= 0 .cse5)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (or .cse4 (let ((.cse6 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse6) (not (= 0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6)))))) (= 0 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse7 .cse8)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse9 .cse8)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse5)) (= (select |v_#valid_BEFORE_CALL_27| .cse3) 0) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse10 (select |v_#valid_BEFORE_CALL_26| .cse10))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse3) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5)) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (and (<= .cse11 0) (<= 0 .cse11)) (= .cse5 .cse3)) (= .cse11 0))))) is different from false [2023-02-15 19:46:24,131 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 ((.cse9 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse7 (select |c_#memory_$Pointer$.base| .cse5)) (.cse12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse4 (= .cse12 0)) (.cse8 (+ .cse12 4)) (.cse3 (select .cse7 4)) (.cse11 (select .cse9 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_31| .cse1))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_25| .cse2))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) .cse4 (not (= 0 .cse5)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (or .cse4 (let ((.cse6 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse6) (not (= 0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6)))))) (= 0 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse7 .cse8)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse9 .cse8)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse5)) (= (select |v_#valid_BEFORE_CALL_27| .cse3) 0) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse10 (select |v_#valid_BEFORE_CALL_26| .cse10))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse3) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5)) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (and (<= .cse11 0) (<= 0 .cse11)) (= .cse5 .cse3)) (= .cse11 0))))) is different from true [2023-02-15 19:46:24,225 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$.offset| .cse6)) (.cse7 (select |c_#memory_$Pointer$.base| .cse6)) (.cse12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse5 (= .cse12 0)) (.cse8 (+ .cse12 4)) (.cse4 (select .cse7 4)) (.cse11 (select .cse9 4))) (and (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_31| .cse2))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= .cse4 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) .cse5 (not (= 0 .cse6)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse7 .cse8)) (or (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse0) (not (= 0 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|))) .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse9 .cse8)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse6 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse6)) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse10 (select |v_#valid_BEFORE_CALL_26| .cse10))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse4) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6)) (or (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (and (<= .cse11 0) (<= 0 .cse11)) (= .cse6 .cse4)) (= .cse11 0))))) is different from false [2023-02-15 19:46:24,231 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$.offset| .cse6)) (.cse7 (select |c_#memory_$Pointer$.base| .cse6)) (.cse12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse5 (= .cse12 0)) (.cse8 (+ .cse12 4)) (.cse4 (select .cse7 4)) (.cse11 (select .cse9 4))) (and (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse2 (select |v_#valid_BEFORE_CALL_31| .cse2))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse3 (select |v_#valid_BEFORE_CALL_25| .cse3))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= .cse4 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) .cse5 (not (= 0 .cse6)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse7 .cse8)) (or (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| .cse0) (not (= 0 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|))) .cse5) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse9 .cse8)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse6 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse6)) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse10 (select |v_#valid_BEFORE_CALL_26| .cse10))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse4) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6)) (or (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (and (<= .cse11 0) (<= 0 .cse11)) (= .cse6 .cse4)) (= .cse11 0))))) is different from true [2023-02-15 19:46:24,287 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$.offset| .cse5)) (.cse6 (select |c_#memory_$Pointer$.base| .cse5)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse7 (+ .cse4 4)) (.cse3 (select .cse6 4)) (.cse10 (select .cse8 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_31| .cse1))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_25| .cse2))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= .cse4 0) (not (= 0 .cse5)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse6 .cse7)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse8 .cse7)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse5)) (= (select |v_#valid_BEFORE_CALL_27| .cse3) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse9 (select |v_#valid_BEFORE_CALL_26| .cse9))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse3) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (and (<= .cse10 0) (<= 0 .cse10)) (= .cse5 .cse3)) (= .cse10 0))))) is different from false [2023-02-15 19:46:24,292 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$.offset| .cse5)) (.cse6 (select |c_#memory_$Pointer$.base| .cse5)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 2)) (.cse7 (+ .cse4 4)) (.cse3 (select .cse6 4)) (.cse10 (select .cse8 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((v_arrayElimIndex_54 Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (<= .cse0 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_31| .cse1))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_25| .cse2))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (not (= 0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= .cse4 0) (not (= 0 .cse5)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse6 .cse7)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| (select .cse8 .cse7)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse5 1) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse5)) (= (select |v_#valid_BEFORE_CALL_27| .cse3) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse9 (select |v_#valid_BEFORE_CALL_26| .cse9))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_26| .cse3) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (or (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (and (<= .cse10 0) (<= 0 .cse10)) (= .cse5 .cse3)) (= .cse10 0))))) is different from true [2023-02-15 19:46:24,346 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse7)) (.cse10 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select .cse0 (+ (select .cse10 (+ .cse4 4)) 4)))) (let ((.cse3 (+ .cse1 2)) (.cse6 (select .cse10 4))) (and (not (= 0 (select .cse0 4))) (not (= 0 .cse1)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_25| .cse2))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= .cse4 0) (or (= .cse5 .cse1) (and (<= .cse6 0) (<= 0 .cse6)) (= .cse5 .cse7)) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (<= .cse3 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_31| .cse8))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse5)) (= (select |v_#valid_BEFORE_CALL_27| .cse7) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse9 (select |v_#valid_BEFORE_CALL_26| .cse9))) |v_#valid_BEFORE_CALL_26|) (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse5 1) .cse1)) (= (select |v_#valid_BEFORE_CALL_26| .cse7) 1))) (not (= 0 .cse5)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse6 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-02-15 19:46:24,351 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse7)) (.cse10 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select .cse0 (+ (select .cse10 (+ .cse4 4)) 4)))) (let ((.cse3 (+ .cse1 2)) (.cse6 (select .cse10 4))) (and (not (= 0 (select .cse0 4))) (not (= 0 .cse1)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse2 (select |v_#valid_BEFORE_CALL_25| .cse2))) |v_#valid_BEFORE_CALL_25|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))) (= .cse4 0) (or (= .cse5 .cse1) (and (<= .cse6 0) (<= 0 .cse6)) (= .cse5 .cse7)) (exists ((v_arrayElimCell_209 Int) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (and (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (<= .cse3 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (not (= 0 v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_31| .cse8))) |v_#valid_BEFORE_CALL_31|))) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse5)) (= (select |v_#valid_BEFORE_CALL_27| .cse7) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse9 (select |v_#valid_BEFORE_CALL_26| .cse9))) |v_#valid_BEFORE_CALL_26|) (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse5 1) .cse1)) (= (select |v_#valid_BEFORE_CALL_26| .cse7) 1))) (not (= 0 .cse5)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse6 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from true [2023-02-15 19:46:24,412 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (not (= 0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0)) 4))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse10 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse8) (+ (select .cse10 (+ .cse2 4)) 4)))) (let ((.cse1 (+ .cse6 2)) (.cse7 (select .cse10 4))) (and (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= .cse2 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse4)) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse2) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse5 (select |v_#valid_BEFORE_CALL_26| .cse5))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_27| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse4 1) .cse6)) (<= 0 .cse7) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse7 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (not (= 0 .cse6)) (= (select |v_#valid_BEFORE_CALL_27| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_26| .cse8) 1) (not (= 0 .cse4)) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_25| .cse9))) |v_#valid_BEFORE_CALL_25|) (not (= 0 v_arrayElimIndex_54)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4))))))) (= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0) 0))) is different from false [2023-02-15 19:46:24,417 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (not (= 0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0)) 4))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse10 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse8) (+ (select .cse10 (+ .cse2 4)) 4)))) (let ((.cse1 (+ .cse6 2)) (.cse7 (select .cse10 4))) (and (<= .cse1 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= .cse2 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse4)) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse2) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse5 (select |v_#valid_BEFORE_CALL_26| .cse5))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_27| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse4 1) .cse6)) (<= 0 .cse7) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse7 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (not (= 0 .cse6)) (= (select |v_#valid_BEFORE_CALL_27| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_26| .cse8) 1) (not (= 0 .cse4)) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse9 (select |v_#valid_BEFORE_CALL_25| .cse9))) |v_#valid_BEFORE_CALL_25|) (not (= 0 v_arrayElimIndex_54)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4))))))) (= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0) 0))) is different from true [2023-02-15 19:46:24,490 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse4) .cse7))) (let ((.cse2 (+ .cse1 2))) (and (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse0 1) .cse1)) (<= .cse2 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (not (= 0 .cse1)) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3))) |v_#valid_BEFORE_CALL_31|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse0)) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (not (= 0 .cse0)) (= (select |v_#valid_BEFORE_CALL_26| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse5 (select |v_#valid_BEFORE_CALL_25| .cse5))) |v_#valid_BEFORE_CALL_25|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 v_arrayElimIndex_54)) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse6 (select |v_#valid_BEFORE_CALL_26| .cse6))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_27| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))))))) (= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (not (= 0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse7))) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0))) is different from false [2023-02-15 19:46:24,494 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7| Int) (v_arrayElimCell_209 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_26| (Array Int Int)) (v_arrayElimIndex_54 Int) (|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse4) .cse7))) (let ((.cse2 (+ .cse1 2))) (and (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_54)) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 0) (= 0 (select (store |v_#valid_BEFORE_CALL_26| .cse0 1) .cse1)) (<= .cse2 |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_24| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (not (= 0 .cse1)) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_31|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_31| .cse3))) |v_#valid_BEFORE_CALL_31|) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_209) 1) (= 0 (select |v_#valid_BEFORE_CALL_26| .cse0)) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimCell_209) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 0) (not (= 0 .cse0)) (= (select |v_#valid_BEFORE_CALL_26| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_24| |v_#valid_BEFORE_CALL_25|))) (store |v_#valid_BEFORE_CALL_24| .cse5 (select |v_#valid_BEFORE_CALL_25| .cse5))) |v_#valid_BEFORE_CALL_25|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 v_arrayElimIndex_54)) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_26|))) (store |v_#valid_BEFORE_CALL_27| .cse6 (select |v_#valid_BEFORE_CALL_26| .cse6))) |v_#valid_BEFORE_CALL_26|) (= (select |v_#valid_BEFORE_CALL_27| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_7|) 1))))))) (= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (not (= 0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse7))) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (<= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0))) is different from true [2023-02-15 19:46:24,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:46:24,643 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2023-02-15 19:46:24,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-15 19:46:24,644 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 48 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2023-02-15 19:46:24,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:46:24,645 INFO L225 Difference]: With dead ends: 85 [2023-02-15 19:46:24,645 INFO L226 Difference]: Without dead ends: 82 [2023-02-15 19:46:24,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 51 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=217, Invalid=1774, Unknown=105, NotChecked=6834, Total=8930 [2023-02-15 19:46:24,646 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 838 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 19:46:24,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 394 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 339 Invalid, 0 Unknown, 838 Unchecked, 0.3s Time] [2023-02-15 19:46:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-15 19:46:24,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2023-02-15 19:46:24,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 70 states have internal predecessors, (79), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 19:46:24,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2023-02-15 19:46:24,677 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 46 [2023-02-15 19:46:24,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:46:24,677 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2023-02-15 19:46:24,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 48 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:46:24,677 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2023-02-15 19:46:24,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 19:46:24,678 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:46:24,678 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:46:24,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 19:46:24,878 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,SelfDestructingSolverStorable12 [2023-02-15 19:46:24,879 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:46:24,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:46:24,879 INFO L85 PathProgramCache]: Analyzing trace with hash -397767570, now seen corresponding path program 2 times [2023-02-15 19:46:24,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:46:24,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584081170] [2023-02-15 19:46:24,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:46:24,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:46:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:46:26,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:46:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:46:26,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:46:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:46:26,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:46:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:46:27,067 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:46:27,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:46:27,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584081170] [2023-02-15 19:46:27,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584081170] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:46:27,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083315526] [2023-02-15 19:46:27,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:46:27,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:46:27,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:46:27,069 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 19:46:27,070 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 19:46:27,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:46:27,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:46:27,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 177 conjunts are in the unsatisfiable core [2023-02-15 19:46:27,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:46:27,291 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 19:46:27,334 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 19:46:27,456 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:46:27,456 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 19:46:27,637 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 19:46:27,650 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 17 treesize of output 22 [2023-02-15 19:46:27,656 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 17 treesize of output 22 [2023-02-15 19:46:27,739 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 19:46:27,739 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 19:46:27,840 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:46:27,841 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 24 treesize of output 20 [2023-02-15 19:46:27,857 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:46:27,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-02-15 19:46:27,935 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:46:27,935 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 56 treesize of output 53 [2023-02-15 19:46:27,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 19:46:28,263 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:46:28,264 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 70 treesize of output 33 [2023-02-15 19:46:28,267 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 19:46:28,270 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 19:46:28,357 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 19:46:28,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:46:28,450 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:46:28,450 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 64 [2023-02-15 19:46:28,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:46:28,467 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 19:46:28,467 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 19:46:28,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:46:28,479 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 19:46:28,946 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:46:28,968 INFO L321 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2023-02-15 19:46:28,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 229 treesize of output 128 [2023-02-15 19:46:28,994 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-15 19:46:28,994 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 479 treesize of output 316 [2023-02-15 19:46:29,025 INFO L321 Elim1Store]: treesize reduction 104, result has 22.4 percent of original size [2023-02-15 19:46:29,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 438 treesize of output 287 [2023-02-15 19:46:29,051 INFO L321 Elim1Store]: treesize reduction 74, result has 21.3 percent of original size [2023-02-15 19:46:29,051 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 423 treesize of output 347 [2023-02-15 19:46:29,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:46:29,068 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 138 treesize of output 67 [2023-02-15 19:46:29,073 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 48 treesize of output 86 [2023-02-15 19:46:29,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:46:29,509 INFO L321 Elim1Store]: treesize reduction 27, result has 12.9 percent of original size [2023-02-15 19:46:29,509 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 341 treesize of output 106 [2023-02-15 19:46:29,530 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 19:46:29,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 26 [2023-02-15 19:46:29,584 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 19:46:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:46:29,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:46:35,084 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse20 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse20)) (.cse19 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse20) 4))) (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8)) (.cse10 (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) .cse19 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (.cse11 (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse19 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)))) (and (forall ((v_ArrVal_2779 (Array Int Int)) (v_ArrVal_2780 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int))) (let ((.cse6 (store .cse11 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2782)) (.cse3 (store .cse10 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2779))) (let ((.cse8 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse7 (select (select .cse6 .cse8) .cse9))) (or (= (let ((.cse4 (select (select .cse3 .cse8) .cse9)) (.cse5 (+ .cse7 4))) (select (select (let ((.cse0 (store |c_#memory_int| .cse2 v_ArrVal_2783))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse1 v_ArrVal_2780))) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))) |c_ULTIMATE.start_main_~data~0#1|) (= .cse7 0)))))) (forall ((v_ArrVal_2779 (Array Int Int)) (v_ArrVal_2780 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int))) (let ((.cse16 (store .cse11 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2782)) (.cse14 (store .cse10 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2779))) (let ((.cse17 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (+ (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse12 (select (select .cse14 .cse17) .cse18))) (or (= .cse12 0) (= (let ((.cse15 (+ (select (select .cse16 .cse17) .cse18) 4))) (select (select (let ((.cse13 (store |c_#memory_int| .cse2 v_ArrVal_2783))) (store .cse13 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse1 v_ArrVal_2780))) (select (select .cse14 .cse12) .cse15)) (select (select .cse16 .cse12) .cse15))) |c_ULTIMATE.start_main_~data~0#1|)))))))))) is different from false [2023-02-15 19:46:35,131 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse21 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse20) .cse21)) (.cse19 (+ (select (select |c_#memory_$Pointer$.offset| .cse20) .cse21) 4))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8)) (.cse10 (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) .cse19 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (.cse11 (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse19 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)))) (and (forall ((v_ArrVal_2779 (Array Int Int)) (v_ArrVal_2780 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int))) (let ((.cse7 (store .cse11 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2782)) (.cse4 (store .cse10 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2779))) (let ((.cse8 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (+ (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select (select .cse7 .cse8) .cse9))) (or (= .cse0 0) (= (let ((.cse5 (select (select .cse4 .cse8) .cse9)) (.cse6 (+ .cse0 4))) (select (select (let ((.cse1 (store |c_#memory_int| .cse3 v_ArrVal_2783))) (store .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse2 v_ArrVal_2780))) (select (select .cse4 .cse5) .cse6)) (select (select .cse7 .cse5) .cse6))) |c_ULTIMATE.start_main_~data~0#1|)))))) (forall ((v_ArrVal_2779 (Array Int Int)) (v_ArrVal_2780 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int))) (let ((.cse16 (store .cse11 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2782)) (.cse14 (store .cse10 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2779))) (let ((.cse17 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (+ (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse12 (select (select .cse14 .cse17) .cse18))) (or (= .cse12 0) (= (let ((.cse15 (+ (select (select .cse16 .cse17) .cse18) 4))) (select (select (let ((.cse13 (store |c_#memory_int| .cse3 v_ArrVal_2783))) (store .cse13 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse2 v_ArrVal_2780))) (select (select .cse14 .cse12) .cse15)) (select (select .cse16 .cse12) .cse15))) |c_ULTIMATE.start_main_~data~0#1|)))))))))) is different from false [2023-02-15 19:46:35,164 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse21 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse20) .cse21)) (.cse19 (+ (select (select |c_#memory_$Pointer$.offset| .cse20) .cse21) 4))) (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 8)) (.cse9 (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) .cse19 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))) (.cse10 (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse19 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)))) (and (forall ((v_ArrVal_2779 (Array Int Int)) (v_ArrVal_2780 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int))) (let ((.cse6 (store .cse10 |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2782)) (.cse3 (store .cse9 |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2779))) (let ((.cse7 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse4 (select (select .cse3 .cse7) .cse8))) (or (= (let ((.cse5 (+ (select (select .cse6 .cse7) .cse8) 4))) (select (select (let ((.cse0 (store |c_#memory_int| .cse2 v_ArrVal_2783))) (store .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) .cse1 v_ArrVal_2780))) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))) |c_ULTIMATE.start_main_~data~0#1|) (= .cse4 0)))))) (forall ((v_ArrVal_2779 (Array Int Int)) (v_ArrVal_2780 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int))) (let ((.cse15 (store .cse10 |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2782)) (.cse12 (store .cse9 |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2779))) (let ((.cse17 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (+ (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse16 (select (select .cse15 .cse17) .cse18))) (or (= (let ((.cse13 (select (select .cse12 .cse17) .cse18)) (.cse14 (+ .cse16 4))) (select (select (let ((.cse11 (store |c_#memory_int| .cse2 v_ArrVal_2783))) (store .cse11 |c_ULTIMATE.start_dll_append_#t~ret7#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) .cse1 v_ArrVal_2780))) (select (select .cse12 .cse13) .cse14)) (select (select .cse15 .cse13) .cse14))) |c_ULTIMATE.start_main_~data~0#1|) (= .cse16 0)))))))))) is different from false [2023-02-15 19:46:35,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:46:35,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 3331 treesize of output 3308 [2023-02-15 19:46:35,292 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:46:35,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29708 treesize of output 29714 [2023-02-15 19:46:35,313 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 29703 treesize of output 27095 [2023-02-15 19:46:35,337 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 29715 treesize of output 27107 [2023-02-15 19:46:36,491 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 655 treesize of output 3 [2023-02-15 19:46:37,037 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 655 treesize of output 3 [2023-02-15 19:46:37,544 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 655 treesize of output 3 [2023-02-15 19:46:37,550 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 655 treesize of output 3 [2023-02-15 19:46:37,773 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 655 treesize of output 3 [2023-02-15 19:46:38,227 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 655 treesize of output 3